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 24, 2026 11:14Victor MerckléVictor MerckléScore: 63,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:1563,13730,892,46823,361,00002,113,536
2Jun 24, 2026 11:1563,25130,811,63323,403,00002,113,536
3Jun 24, 2026 11:1563,30530,865,92822,398,0001,025,0002,113,536
4Jun 24, 2026 11:1563,34531,277,99722,431,0001,007,0002,113,536
5Jun 24, 2026 11:1563,40831,293,88622,445,0001,016,0002,113,536
6Jun 24, 2026 11:1563,82132,492,53522,609,0001,005,0002,113,536
7Jun 24, 2026 11:1563,89131,097,01122,632,0001,008,0002,113,536
8Jun 24, 2026 11:15624,575238,927,580230,078,0001,015,0002,113,536
9Jun 24, 2026 11:15625,391239,328,310230,371,0001,024,0002,113,536