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 20:31Victor MerckléVictor MerckléScore: 64,675Success
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 20:3264,55135,647,09422,840,0001,044,0002,113,536
2May 11, 2026 20:3264,58932,649,59722,885,0001,013,0002,113,536
3May 11, 2026 20:3264,65132,624,85722,834,0001,087,0002,113,536
4May 11, 2026 20:3264,67232,706,38222,897,0001,032,0002,113,536
5May 11, 2026 20:3264,67535,693,10222,830,0001,100,0002,113,536
6May 11, 2026 20:3264,69432,889,98222,839,0001,098,0002,113,536
7May 11, 2026 20:3265,00234,471,45123,020,0001,031,0002,113,536
8May 11, 2026 20:3265,02434,341,08923,022,0001,037,0002,113,536
9May 11, 2026 20:3265,38334,893,85723,037,0001,155,0002,113,536