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:05IlyaIlyaScore: 58,767Success
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:0758,50232,513,87820,446,0001,200,0002,113,536
2Jul 12, 2026 19:0758,55131,364,09020,464,0001,200,0002,113,536
3Jul 12, 2026 19:0758,55931,352,75820,461,0001,206,0002,113,536
4Jul 12, 2026 19:0758,72932,067,20220,518,0001,212,0002,113,536
5Jul 12, 2026 19:0758,76731,464,34520,536,0001,208,0002,113,536
6Jul 12, 2026 19:0758,84831,964,92620,572,0001,202,0002,113,536
7Jul 12, 2026 19:0721,500,3027,965,479,8387,802,260,000152,852,0002,113,536
8Jul 12, 2026 19:0721,603,6028,003,178,3317,846,399,000146,934,0002,113,536
9Jul 12, 2026 19:0721,754,2818,058,989,5697,901,067,000148,017,0002,113,536