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 6, 2026 10:44Victor MerckléVictor MerckléScore: 64,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 10:4564,16732,805,77022,601,0001,141,0002,113,536
2Jun 6, 2026 10:4564,17232,859,75222,600,0001,144,0002,113,536
3Jun 6, 2026 10:4564,20232,934,81922,610,0001,145,0002,113,536
4Jun 6, 2026 10:4564,26235,446,19822,636,0001,141,0002,113,536
5Jun 6, 2026 10:4564,33532,940,26022,651,0001,153,0002,113,536
6Jun 6, 2026 10:4564,35932,983,30522,659,0001,154,0002,113,536
7Jun 6, 2026 10:4564,72132,988,24522,809,0001,138,0002,113,536
8Jun 6, 2026 10:4564,73533,052,87422,801,0001,151,0002,113,536
9Jun 6, 2026 10:4564,74533,053,59622,802,0001,154,0002,113,536