title: How to count active bits in less then O(n)
body: <p>I have a bitset of length <code>n</code>. say <code>0100010010</code> How ta claculate all its <code>1</code>'s not reading all the <code>0</code>'s (faster than in O(n))?</p>