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 11, 2026 15:29Victor MerckléVictor MerckléScore: 67,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:3067,42933,849,58023,753,0001,196,0002,113,536
2May 11, 2026 15:3067,47835,804,45823,748,0001,219,0002,113,536
3May 11, 2026 15:3067,48136,543,38023,748,0001,220,0002,113,536
4May 11, 2026 15:3067,68133,836,86323,838,0001,204,0002,113,536
5May 11, 2026 15:3067,74334,081,70323,861,0001,204,0002,113,536
6May 11, 2026 15:3067,97533,902,58623,943,0001,208,0002,113,536
7May 11, 2026 15:3068,04836,114,66623,959,0001,219,0002,113,536
8May 11, 2026 15:3068,32933,984,35424,035,0001,247,0002,113,536
9May 11, 2026 15:30190,40279,147,51369,265,0001,184,0002,113,536