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 16:36Victor MerckléVictor MerckléScore: 69,024Success
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 16:3768,88634,725,77324,356,0001,132,0002,113,536
2May 11, 2026 16:3768,95934,797,44624,376,0001,139,0002,113,536
3May 11, 2026 16:3769,01336,368,04224,399,0001,136,0002,113,536
4May 11, 2026 16:3769,01837,330,26724,388,0001,149,0002,113,536
5May 11, 2026 16:3769,02435,271,81724,410,0001,129,0002,113,536
6May 11, 2026 16:3769,02435,204,44924,405,0001,134,0002,113,536
7May 11, 2026 16:3769,38136,288,61724,514,0001,157,0002,113,536
8May 11, 2026 16:3769,52135,544,25124,703,0001,020,0002,113,536
9May 11, 2026 16:3770,05135,646,66024,766,0001,153,0002,113,536