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 10:00Victor MerckléVictor MerckléScore: 58,359Success
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:0258,11829,907,92920,358,0001,146,0002,138,112
2Aug 31, 2026 10:0258,22929,919,90020,343,0001,202,0002,138,112
3Aug 31, 2026 10:0258,26429,945,44820,414,0001,144,0002,138,112
4Aug 31, 2026 10:0258,27529,960,29720,417,0001,145,0002,138,112
5Aug 31, 2026 10:0258,35930,050,08120,390,0001,203,0002,138,112
6Aug 31, 2026 10:0258,39130,015,28620,376,0001,229,0002,138,112
7Aug 31, 2026 10:0258,39430,758,82220,361,0001,245,0002,138,112
8Aug 31, 2026 10:0258,61030,335,06220,440,0001,246,0002,138,112
9Aug 31, 2026 10:0260,40237,273,52021,107,0001,242,0002,138,112