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 16, 2026 16:31M-RochatM-RochatScore: 67,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:3267,46733,726,70623,941,0001,022,0002,113,536
2May 16, 2026 16:3267,47234,782,94523,933,0001,032,0002,113,536
3May 16, 2026 16:3267,47534,412,57923,930,0001,036,0002,113,536
4May 16, 2026 16:3267,65135,415,34924,020,0001,011,0002,113,536
5May 16, 2026 16:3267,68333,796,30224,034,0001,009,0002,113,536
6May 16, 2026 16:3267,77034,170,69924,068,0001,007,0002,113,536
7May 16, 2026 16:3267,97034,819,08124,126,0001,023,0002,113,536
8May 16, 2026 16:3268,01035,505,81424,149,0001,015,0002,113,536
9May 16, 2026 16:3268,04834,914,50124,163,0001,015,0002,113,536