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 21, 2026 18:25M-RochatM-RochatScore: 59,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:2659,28931,388,21720,872,0001,065,0002,113,536
2May 21, 2026 18:2659,41631,972,95420,923,0001,061,0002,113,536
3May 21, 2026 18:2659,47535,662,62220,849,0001,157,0002,113,536
4May 21, 2026 18:2659,49134,301,36920,862,0001,150,0002,113,536
5May 21, 2026 18:2659,55632,897,66420,889,0001,147,0002,113,536
6May 21, 2026 18:2659,59131,335,81320,989,0001,060,0002,113,536
7May 21, 2026 18:2659,59132,659,10520,897,0001,152,0002,113,536
8May 21, 2026 18:2659,75931,318,85920,952,0001,159,0002,113,536
9May 21, 2026 18:2659,83234,250,30120,962,0001,176,0002,113,536