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 12, 2026 00:05Victor MerckléVictor MerckléScore: 64,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:0664,39132,567,30322,740,0001,085,0002,113,536
2May 12, 2026 00:0664,46235,276,69222,759,0001,092,0002,113,536
3May 12, 2026 00:0664,59432,709,04922,804,0001,096,0002,113,536
4May 12, 2026 00:0664,61835,584,95722,816,0001,093,0002,113,536
5May 12, 2026 00:0664,65135,486,70922,828,0001,093,0002,113,536
6May 12, 2026 00:0664,71834,777,51322,898,0001,048,0002,113,536
7May 12, 2026 00:0664,94534,124,82422,941,0001,089,0002,113,536
8May 12, 2026 00:0665,03533,884,18322,968,0001,095,0002,113,536
9May 12, 2026 00:0665,44533,968,64823,117,0001,098,0002,113,536