Digits and Bases · Superchallenge problem

Let $f(n)$ count the ones in the binary numeral of $n$; for example $f(13) = 3$ because $13 = 1101_2$. Compute $\displaystyle\sum_{n=1}^{1000} f(n)$.