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 listMay 11, 2026 21:13Victor MerckléVictor MerckléScore: 65,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 21:1465,03733,493,40423,059,0001,005,0002,113,536
2May 11, 2026 21:1465,10034,745,45923,072,0001,015,0002,113,536
3May 11, 2026 21:1465,24532,972,86023,059,0001,082,0002,113,536
4May 11, 2026 21:1465,25434,023,89323,133,0001,011,0002,113,536
5May 11, 2026 21:1465,30033,005,74523,142,0001,019,0002,113,536
6May 11, 2026 21:1465,35139,475,00723,092,0001,088,0002,113,536
7May 11, 2026 21:1465,48633,020,37523,222,0001,008,0002,113,536
8May 11, 2026 21:1465,50835,171,06623,194,0001,044,0002,113,536
9May 11, 2026 21:1465,67533,126,58423,242,0001,058,0002,113,536