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 2, 2026 12:41IlyaIlyaScore: 59,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:4859,13231,398,60920,800,0001,079,0002,113,536
2Jul 2, 2026 12:4859,21031,447,73420,781,0001,127,0002,113,536
3Jul 2, 2026 12:4859,35631,472,14820,853,0001,109,0002,113,536
4Jul 2, 2026 12:4859,37831,452,31420,878,0001,092,0002,113,536
5Jul 2, 2026 12:4859,45431,929,85320,815,0001,183,0002,113,536
6Jul 2, 2026 12:4859,48631,486,22020,894,0001,116,0002,113,536
7Jul 2, 2026 12:4859,59732,066,40020,850,0001,201,0002,113,536
8Jul 2, 2026 12:4859,70533,717,48120,896,0001,195,0002,113,536
9Jul 2, 2026 12:4859,77531,741,36920,853,0001,264,0002,113,536