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 12, 2026 04:08Victor MerckléVictor MerckléScore: 67,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 04:1066,88135,134,67623,708,0001,038,0002,138,112
2Jun 12, 2026 04:1067,05934,019,46623,772,0001,040,0002,138,112
3Jun 12, 2026 04:1067,14334,049,74223,803,0001,040,0002,138,112
4Jun 12, 2026 04:1067,18934,294,16923,818,0001,042,0002,138,112
5Jun 12, 2026 04:1067,20834,277,34723,826,0001,041,0002,138,112
6Jun 12, 2026 04:1067,24034,281,52323,840,0001,039,0002,138,112
7Jun 12, 2026 04:1067,26234,003,17323,846,0001,041,0002,138,112
8Jun 12, 2026 04:1067,35434,215,74323,882,0001,039,0002,138,112
9Jun 12, 2026 04:1067,64334,534,21823,987,0001,041,0002,138,112