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 listJun 10, 2026 12:20Victor MerckléVictor MerckléScore: 63,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:2163,48932,567,59822,483,0001,008,0002,117,632stderr
2Jun 10, 2026 12:2163,67832,557,56322,553,0001,008,0002,117,632stderr
3Jun 10, 2026 12:2163,79432,655,30022,593,0001,011,0002,117,632stderr
4Jun 10, 2026 12:2163,82932,674,58122,591,0001,026,0002,117,632stderr
5Jun 10, 2026 12:2163,88332,650,10522,615,0001,022,0002,117,632stderr
6Jun 10, 2026 12:2163,94332,650,29822,650,0001,009,0002,117,632stderr
7Jun 10, 2026 12:2164,07232,733,56222,678,0001,029,0002,117,632stderr
8Jun 10, 2026 12:2164,35632,850,18322,797,0001,015,0002,117,632stderr
9Jun 10, 2026 12:21627,727241,374,618231,225,0001,034,0002,117,632stderr