Algorithm to identify top $\log n$ elements in $O(n)$ time
For every $k$, you can find the $k$th largest element in $O(n)$, using a linear time selection algorithm. You can then find the $k$ largest elements by scanning the array.