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 03:27M-RochatM-RochatScore: 64,524Success
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 03:2964,29734,501,26322,708,0001,082,0002,113,536
2May 18, 2026 03:2964,34335,732,60822,728,0001,079,0002,113,536
3May 18, 2026 03:2964,39734,037,29022,729,0001,098,0002,113,536
4May 18, 2026 03:2964,46233,666,18622,725,0001,126,0002,113,536
5May 18, 2026 03:2964,52434,656,78422,730,0001,144,0002,113,536
6May 18, 2026 03:2964,55136,251,95022,744,0001,140,0002,113,536
7May 18, 2026 03:2964,67835,197,49322,865,0001,066,0002,113,536
8May 18, 2026 03:2964,69135,230,99122,848,0001,088,0002,113,536
9May 18, 2026 03:2964,94337,070,70522,865,0001,164,0002,117,632