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 listJul 7, 2026 13:40IlyaIlyaScore: 60,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 13:4259,64031,743,54520,935,0001,132,0002,113,536
2Jul 7, 2026 13:4259,77031,774,67820,925,0001,190,0002,113,536
3Jul 7, 2026 13:4259,97834,008,65420,956,0001,236,0002,113,536
4Jul 7, 2026 13:4260,04031,834,22721,185,0001,030,0002,113,536
5Jul 7, 2026 13:4260,06232,499,01820,962,0001,261,0002,113,536
6Jul 7, 2026 13:4260,08932,480,72721,199,0001,034,0002,113,536
7Jul 7, 2026 13:4260,16232,267,46921,041,0001,219,0002,113,536
8Jul 7, 2026 13:4260,21032,536,38921,044,0001,234,0002,113,536
9Jul 7, 2026 13:4260,31833,196,07821,057,0001,261,0002,113,536