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 11, 2026 15:52Victor MerckléVictor MerckléScore: 67,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:5467,21834,343,73523,653,0001,218,0002,113,536
2May 11, 2026 15:5467,42945,929,46023,819,0001,130,0002,113,536
3May 11, 2026 15:5467,50033,670,14023,802,0001,173,0002,113,536
4May 11, 2026 15:5467,64341,634,11623,930,0001,098,0002,113,536
5May 11, 2026 15:5467,71033,758,56323,852,0001,201,0002,113,536
6May 11, 2026 15:5467,88935,933,11223,907,0001,212,0002,113,536
7May 11, 2026 15:5474,17250,034,18326,419,0001,025,0002,113,536
8May 11, 2026 15:54190,08679,349,14269,163,0001,169,0002,113,536
9May 11, 2026 15:54190,67579,325,58669,387,0001,163,0002,113,536