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 1, 2026 07:56IlyaIlyaScore: 58,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 07:5758,81031,299,64920,661,0001,099,0002,113,536
2Jul 1, 2026 07:5758,87031,245,76720,661,0001,121,0002,113,536
3Jul 1, 2026 07:5758,91331,234,61620,688,0001,110,0002,113,536
4Jul 1, 2026 07:5758,92431,315,68620,701,0001,101,0002,113,536
5Jul 1, 2026 07:5758,97231,339,42520,610,0001,210,0002,113,536
6Jul 1, 2026 07:5758,97531,233,71120,659,0001,162,0002,113,536
7Jul 1, 2026 07:5759,04331,404,96120,659,0001,187,0002,113,536
8Jul 1, 2026 07:5759,15431,781,53820,703,0001,184,0002,113,536
9Jul 1, 2026 07:5759,25631,401,26220,723,0001,202,0002,113,536