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:21Victor MerckléVictor MerckléScore: 64,737Success
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:2264,35634,434,57022,786,0001,026,0002,113,536
2May 12, 2026 00:2264,45932,615,77322,841,0001,009,0002,113,536
3May 12, 2026 00:2264,62933,354,47422,813,0001,100,0002,113,536
4May 12, 2026 00:2264,71634,902,62222,843,0001,102,0002,113,536
5May 12, 2026 00:2264,73733,380,35222,856,0001,097,0002,113,536
6May 12, 2026 00:2264,82432,694,65722,963,0001,022,0002,113,536
7May 12, 2026 00:2264,99733,389,59622,980,0001,069,0002,113,536
8May 12, 2026 00:2265,04833,457,53722,982,0001,086,0002,113,536
9May 12, 2026 00:2265,07035,235,64122,984,0001,092,0002,113,536