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 listAug 31, 2026 09:58Victor MerckléVictor MerckléScore: 56,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 10:0055,97828,945,23920,712,00002,113,536
2Aug 31, 2026 10:0056,03228,765,44520,732,00002,113,536
3Aug 31, 2026 10:0056,07828,738,74820,749,00002,113,536
4Aug 31, 2026 10:0056,08128,998,83520,750,00002,113,536
5Aug 31, 2026 10:0056,11828,855,26520,764,00002,113,536
6Aug 31, 2026 10:0056,12728,893,96720,767,00002,113,536
7Aug 31, 2026 10:0056,22928,754,82720,805,00002,113,536
8Aug 31, 2026 10:0056,27529,050,52120,822,00002,113,536
9Aug 31, 2026 10:0056,40828,906,55019,857,0001,014,0002,113,536