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 8, 2026 01:15Victor MerckléVictor MerckléScore: 64,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:1663,74832,644,46322,521,0001,066,0002,113,536
2Jun 8, 2026 01:1663,80832,714,48222,532,0001,077,0002,113,536
3Jun 8, 2026 01:1663,94033,112,75222,581,0001,077,0002,113,536
4Jun 8, 2026 01:1664,09432,815,46322,578,0001,137,0002,113,536
5Jun 8, 2026 01:1664,10032,819,45222,576,0001,141,0002,113,536
6Jun 8, 2026 01:1664,25932,879,76822,708,0001,068,0002,113,536
7Jun 8, 2026 01:1664,39132,950,89322,691,0001,134,0002,113,536
8Jun 8, 2026 01:1664,52433,023,43722,704,0001,170,0002,113,536
9Jun 8, 2026 01:1664,55933,051,72822,735,0001,152,0002,113,536