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 01:04M-RochatM-RochatScore: 110,224Success
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 01:06109,70249,292,13339,339,0001,251,0002,113,536
2May 16, 2026 01:06109,98949,347,00839,439,0001,257,0002,113,536
3May 16, 2026 01:06110,14049,469,19839,486,0001,266,0002,113,536
4May 16, 2026 01:06110,17049,441,02539,523,0001,240,0002,113,536
5May 16, 2026 01:06110,22449,465,40039,532,0001,251,0002,113,536
6May 16, 2026 01:06110,37551,189,54839,557,0001,282,0002,113,536
7May 16, 2026 01:06110,82151,041,41339,736,0001,268,0002,113,536
8May 16, 2026 01:06111,04350,065,48439,812,0001,274,0002,113,536
9May 16, 2026 01:06111,51850,808,73940,196,0001,066,0002,113,536