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 3, 2026 12:56IlyaIlyaScore: 59,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 12:5958,89131,280,42520,671,0001,119,0002,113,536
2Jul 3, 2026 12:5959,00231,369,81920,716,0001,115,0002,113,536
3Jul 3, 2026 12:5959,12131,888,47920,653,0001,222,0002,113,536
4Jul 3, 2026 12:5959,12431,437,94420,683,0001,193,0002,113,536
5Jul 3, 2026 12:5959,21631,950,06120,695,0001,215,0002,113,536
6Jul 3, 2026 12:5959,24031,454,08020,705,0001,214,0002,113,536
7Jul 3, 2026 12:5959,29131,444,08720,728,0001,210,0002,113,536
8Jul 3, 2026 12:5959,32131,992,29020,726,0001,223,0002,113,536
9Jul 3, 2026 12:5959,58632,228,83620,789,0001,258,0002,113,536