LeetCode 338 Counting Bits - Why Naive Fails

For each number, count its bits individually using Brian Kernighan's trick.

Each count takes $O(k)$ where $k$ is the number of set bits. Summed over $n$ numbers, that's $O(n \log n)$ in the worst case.

Can you compute each count in $O(1)$ using previous results?