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 listJun 24, 2026 19:02Victor MerckléVictor MerckléScore: 75,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 19:0375,07536,982,25226,727,0001,051,0002,146,304
2Jun 24, 2026 19:0375,36237,029,77626,827,0001,057,0002,146,304
3Jun 24, 2026 19:0375,36737,083,85326,826,0001,060,0002,146,304
4Jun 24, 2026 19:0375,56737,174,56926,873,0001,087,0002,146,304
5Jun 24, 2026 19:0375,64537,189,01626,944,0001,045,0002,146,304
6Jun 24, 2026 19:0375,69137,194,35826,790,0001,216,0002,146,304
7Jun 24, 2026 19:0375,76437,218,77226,950,0001,083,0002,146,304
8Jun 24, 2026 19:0375,78637,257,00226,898,0001,143,0002,146,304
9Jun 24, 2026 19:0376,35637,472,91227,167,0001,085,0002,146,304