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 18, 2026 18:15M-RochatM-RochatScore: 60,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:1660,65633,239,30721,373,0001,070,0002,113,536
2May 18, 2026 18:1660,83733,464,42321,343,0001,167,0002,113,536
3May 18, 2026 18:1660,84033,606,38321,501,0001,010,0002,113,536
4May 18, 2026 18:1660,86433,607,58221,371,0001,149,0002,113,536
5May 18, 2026 18:1660,99132,268,97921,472,0001,095,0002,113,536
6May 18, 2026 18:1661,07833,600,11321,556,0001,043,0002,113,536
7May 18, 2026 18:1661,13732,854,00021,444,0001,177,0002,113,536
8May 18, 2026 18:1661,15633,296,70421,615,0001,013,0002,113,536
9May 18, 2026 18:1662,73746,227,77622,176,0001,037,0002,113,536