What is the fastest way to count all set bits? The number from which I am counting bits is from 1<=n<2^63, only positive values.
For now i use bitset from the l
