TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listMay 18, 2026 16:36M-RochatM-RochatScore: 59,916Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 16:3759,75434,227,28320,965,0001,144,0002,113,536
2May 18, 2026 16:3759,79432,265,08920,964,0001,160,0002,113,536
3May 18, 2026 16:3759,83733,277,50821,002,0001,138,0002,113,536
4May 18, 2026 16:3759,91332,335,53321,015,0001,153,0002,113,536
5May 18, 2026 16:3759,91633,621,66221,014,0001,155,0002,113,536
6May 18, 2026 16:3759,98631,907,80521,019,0001,176,0002,113,536
7May 18, 2026 16:3760,03232,889,38821,054,0001,158,0002,113,536
8May 18, 2026 16:3760,05131,394,56121,071,0001,148,0002,113,536
9May 18, 2026 16:3760,06233,334,27921,061,0001,162,0002,113,536