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 listJun 25, 2026 02:21Victor MerckléVictor MerckléScore: 58,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 02:2258,54829,080,81120,628,0001,035,0002,113,536
2Jun 25, 2026 02:2258,61829,396,35320,661,0001,028,0002,113,536
3Jun 25, 2026 02:2258,64529,218,90820,694,0001,005,0002,113,536
4Jun 25, 2026 02:2258,70529,728,29020,714,0001,007,0002,113,536
5Jun 25, 2026 02:2258,71329,821,77320,713,0001,011,0002,113,536
6Jun 25, 2026 02:2258,77029,783,73820,736,0001,009,0002,113,536
7Jun 25, 2026 02:2258,81029,451,83020,755,0001,005,0002,113,536
8Jun 25, 2026 02:2258,83229,226,97720,761,0001,007,0002,113,536
9Jun 25, 2026 02:2259,08629,508,50420,825,0001,037,0002,113,536