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 8, 2026 22:57IlyaIlyaScore: 21,574,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:0058,25431,190,29220,442,0001,112,0002,113,536
2Jul 8, 2026 23:0058,67031,317,39320,509,0001,199,0002,113,536
3Jul 8, 2026 23:0058,82732,109,49920,547,0001,219,0002,113,536
4Jul 8, 2026 23:0021,558,3407,987,365,6447,825,800,000150,786,0002,113,536
5Jul 8, 2026 23:0021,574,0897,992,293,5777,833,179,000149,234,0002,113,536
6Jul 8, 2026 23:0021,616,5548,008,017,8557,846,441,000151,684,0002,113,536
7Jul 8, 2026 23:0021,661,8488,026,272,8347,864,292,000150,592,0002,113,536
8Jul 8, 2026 23:0021,679,9708,031,456,6807,870,886,000150,703,0002,113,536
9Jul 8, 2026 23:0021,761,0818,061,622,3807,897,560,000154,040,0002,113,536