def vec_sort2(input_li):
    bv = bitarray(len(input_li))
bv.setall(0)
for i in input_li:
    bv[i] = 1
return [i for i in range(len(bv)) if bv[i]]
how to implement a really efficient bitvector sorting in python