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 listJan 13, 2026 00:39Josu San MartinJosu San MartinScore: 68,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:3968,58451,463,91524,361,0001,015,0002,351,104
2Jan 13, 2026 00:3968,74654,287,08225,436,00002,281,472
3Jan 13, 2026 00:3968,75145,365,46424,421,0001,017,0002,281,472
4Jan 13, 2026 00:3968,90844,370,52324,477,0001,019,0002,281,472
5Jan 13, 2026 00:3968,97346,693,19425,520,00002,281,472
6Jan 13, 2026 00:3969,05957,260,22424,530,0001,022,0002,281,472
7Jan 13, 2026 00:3969,08646,702,96125,562,00002,355,200
8Jan 13, 2026 00:3969,09252,616,00525,564,00002,281,472
9Jan 13, 2026 00:3969,37650,579,38024,643,0001,026,0002,281,472