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 1, 2026 13:45IlyaIlyaScore: 63,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 13:4663,07033,317,50222,130,0001,206,0002,113,536
2Jul 1, 2026 13:4663,08133,311,78622,153,0001,187,0002,113,536
3Jul 1, 2026 13:4663,09434,721,67022,128,0001,217,0002,113,536
4Jul 1, 2026 13:4663,21033,423,26822,152,0001,236,0002,113,536
5Jul 1, 2026 13:4663,24333,385,74622,189,0001,211,0002,113,536
6Jul 1, 2026 13:4663,42133,546,05722,262,0001,204,0002,113,536
7Jul 1, 2026 13:4663,43533,461,45922,273,0001,198,0002,113,536
8Jul 1, 2026 13:4621,686,0898,034,035,4157,864,339,000159,514,0002,113,536
9Jul 1, 2026 13:4621,761,8548,061,958,2107,897,482,000154,404,0002,113,536