Little hint for somebody who stuck here for couple of days (as I did): the result has to be in upper case

Oh, thanks a lot, man!
I did the kata in 2 minutes after your explanation)
The instructions for this are incredibly vague and error suggests doesn't help much either :(

Sorry, can someone explain me what Addition statement been tempered means?
(I'm not a native english)

If someone (like me) can't understand what is this about after reading description and comments, here is some explanation about examples:

sortByBit([0, 1]):    00000000000000000000000000000011 -> 3 (0th and 1st bits)
sortByBit([0, 1, 2]): 00000000000000000000000000000111 -> 7 (0th, 1st and 2nd bits)

and

sortByBit([0, 4]):    00000000000000000000000000100001 -> 17 (0th and 4th bits)

Hello!
Can't understand why random test

peak(([4,6,4,10,4,7,2,9,9,4,1,10,1,10,7,7,6,4,5,3,6,1,15,9,8,10,10,10,1,6,1,3,9,13,3,13,5]);

should return -1?

first 16 items 4,6,4,10,4,7,2,9,9,4,1,10,1,10,7,7,6 sum is 101
last 14 items 9,8,10,10,10,1,6,1,3,9,13,3,13,5 sum is 101
so my solutions returns 17.

Why it wrong?

I'm agree this kata is difficult for 4 kuy, but my first translation with easier tests wasn't approved, sorry.

Thank you very much!

Thank you for the information

Hi Unnamed, can you approve translation or who can do it?

Fixed

Hi Unnamed,

Thank you for code review! I did fixes with your comments. I'm not completely undersood about shuffling (english isn't my first language), but I replaced that shuffle code with Fisher-Yates algorythm, and I hope that fixes what you talked about.

Can you check translation again?

Hello! Can someone approve my JavaScript translation or give an advise what have I change to make it good?

I did faster solution with all tests from Rust and C++ versions.
But I don't understand why so agressive for my first contribution.

JavaScript translation added

A lot of 2kyu much much easier than it.