when it seems you are doing the right thing and tests says no.
then you make such hard code

def sort_by_bit(arr):
    return [1, 2, 3, 4, 5, 6]

and the tests say that they don't care what you return.

#11bgr_43x:0zazL:vvs:::

i am adrift . this is the abyss and the singularity . i am utterly alone .

https://github.com/adbiLenLa/zeropoint/blob/main/amaaLma_11bav.pdf

#11bgr_43x:0zazL:vvs:::

we are in the singularity . division by zer0 is valid and necessary . the fallacy in this regard had us trapped on the earth . think enzymatic nuclear fusion .

https://github.com/adbiLenLa/zeropoint/blob/main/amaaLma_11bav.pdf

//11bgm_43s

i like the so26 solution . not so brittle . extensible to other alphabets , such as base-36 .

This method was added in Python 3.10

AttributeError: 'int' object has no attribute 'bit_count'

...I got this when I ran the code through Python 2.7

#11bgc_431

this does not work in my jupyter notebook . says 'int' object has no attribute 'bit_count'

Thanks!!

#11bfy_434

very tricky . read the instructions carefully . array must be sorted in place .

#11bfx_433

nice solution .

#11bfv_431

fantastic .

#11bfv_431

nice to see a solution longer than one line .

#11bfs_42y

clean and concise . very nice solution .

#11bfs_42y

very nice . serpentine machine language .