We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I'm using go and only have 8s to count. I used a fast bit counting which takes only 2ns to count a single number, but for the whole list it slows a lot. How's everyone approach to this problem ? I know we can't count number by number but I can't find any viable ideal
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
2's complement
You are viewing a single comment's thread. Return to all comments →
I'm using go and only have 8s to count. I used a fast bit counting which takes only 2ns to count a single number, but for the whole list it slows a lot. How's everyone approach to this problem ? I know we can't count number by number but I can't find any viable ideal