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 5, 2026 12:59Victor MerckléVictor MerckléScore: 64,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 13:0064,17032,829,60922,698,0001,045,0002,113,536
2Jun 5, 2026 13:0064,39732,894,30022,766,0001,061,0002,113,536
3Jun 5, 2026 13:0064,44532,884,73822,721,0001,124,0002,113,536
4Jun 5, 2026 13:0064,47232,967,58922,710,0001,145,0002,113,536
5Jun 5, 2026 13:0064,68933,034,04922,788,0001,147,0002,113,536
6Jun 5, 2026 13:0064,70233,032,26922,790,0001,150,0002,113,536
7Jun 5, 2026 13:0064,75933,009,59322,902,0001,059,0002,113,536
8Jun 5, 2026 13:0065,02733,175,51722,919,0001,141,0002,113,536
9Jun 5, 2026 13:0065,05933,142,51622,920,0001,152,0002,113,536