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 listApr 26, 2026 15:16Charles CabergsCharles CabergsScore: 70,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:1670,45143,361,90924,062,0002,005,0002,371,584
2Apr 26, 2026 15:1670,63244,456,42825,129,0001,005,0002,359,296
3Apr 26, 2026 15:1670,74845,142,76724,164,0002,013,0002,351,104
4Apr 26, 2026 15:1670,81645,041,10024,187,0002,015,0002,363,392
5Apr 26, 2026 15:1670,88345,999,07824,210,0002,017,0002,363,392
6Apr 26, 2026 15:1671,16443,217,37826,331,00002,371,584
7Apr 26, 2026 15:1671,19446,133,62125,329,0001,013,0002,363,392
8Apr 26, 2026 15:1671,20844,433,67425,334,0001,013,0002,306,048
9Apr 26, 2026 15:1674,79135,636,86725,624,0002,049,0002,293,760