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 12, 2026 19:22IlyaIlyaScore: 58,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 19:2358,49131,245,27020,523,0001,119,0002,113,536
2Jul 12, 2026 19:2358,50232,303,21420,456,0001,190,0002,113,536
3Jul 12, 2026 19:2358,53531,484,79420,477,0001,181,0002,113,536
4Jul 12, 2026 19:2358,58631,388,63820,511,0001,166,0002,113,536
5Jul 12, 2026 19:2358,63731,997,16120,477,0001,219,0002,113,536
6Jul 12, 2026 19:2358,67231,431,55820,514,0001,195,0002,113,536
7Jul 12, 2026 19:2358,67531,936,21820,502,0001,208,0002,113,536
8Jul 12, 2026 19:2358,70531,628,09920,502,0001,219,0002,113,536
9Jul 12, 2026 19:2358,76731,652,10520,552,0001,192,0002,113,536