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:34M-RochatM-RochatScore: 59,591Success
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:3659,52431,257,86620,873,0001,151,0002,113,536
2May 18, 2026 18:3659,52733,030,82020,868,0001,157,0002,113,536
3May 18, 2026 18:3659,53732,324,26220,881,0001,148,0002,113,536
4May 18, 2026 18:3659,55633,291,38020,899,0001,137,0002,113,536
5May 18, 2026 18:3659,59131,202,16120,901,0001,148,0002,113,536
6May 18, 2026 18:3659,63733,114,91621,005,0001,061,0002,113,536
7May 18, 2026 18:3659,66233,304,42921,006,0001,069,0002,113,536
8May 18, 2026 18:3659,66231,437,68720,915,0001,160,0002,113,536
9May 18, 2026 18:3659,80232,322,29720,969,0001,158,0002,113,536