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:23M-RochatM-RochatScore: 59,805Success
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:2459,60031,313,34920,896,0001,156,0002,113,536
2May 18, 2026 18:2459,67533,350,86520,906,0001,174,0002,113,536
3May 18, 2026 18:2459,71335,703,42820,975,0001,119,0002,113,536
4May 18, 2026 18:2459,71634,121,59820,925,0001,170,0002,113,536
5May 18, 2026 18:2459,80532,171,70121,108,0001,020,0002,113,536
6May 18, 2026 18:2459,84031,876,54620,982,0001,159,0002,113,536
7May 18, 2026 18:2459,84331,367,46720,992,0001,150,0002,113,536
8May 18, 2026 18:2459,86433,130,40520,978,0001,172,0002,113,536
9May 18, 2026 18:2460,03733,509,41421,060,0001,154,0002,113,536