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 23:38IlyaIlyaScore: 59,259Success
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:4058,27531,222,45620,444,0001,118,0002,113,536
2Jul 8, 2026 23:4058,47831,311,92820,455,0001,182,0002,113,536
3Jul 8, 2026 23:4058,51831,351,83020,531,0001,121,0002,113,536
4Jul 8, 2026 23:4058,54831,285,43820,517,0001,146,0002,113,536
5Jul 8, 2026 23:4059,25931,591,82220,699,0001,227,0002,113,536
6Jul 8, 2026 23:4021,484,7187,959,227,2627,796,998,000152,348,0002,113,536
7Jul 8, 2026 23:4021,572,4597,991,820,9717,832,023,000149,787,0002,113,536
8Jul 8, 2026 23:4021,608,7298,005,192,3507,841,385,000153,845,0002,113,536
9Jul 8, 2026 23:4021,717,2948,045,215,7037,886,695,000148,704,0002,113,536