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:38M-RochatM-RochatScore: 59,651Success
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:3959,35431,244,27020,899,0001,062,0002,113,536
2May 18, 2026 18:3959,40533,111,38820,893,0001,087,0002,113,536
3May 18, 2026 18:3959,46431,681,86920,940,0001,062,0002,113,536
4May 18, 2026 18:3959,48131,963,38820,859,0001,149,0002,113,536
5May 18, 2026 18:3959,65134,210,10720,913,0001,158,0002,113,536
6May 18, 2026 18:3959,71032,114,27421,006,0001,087,0002,113,536
7May 18, 2026 18:3959,78331,419,70920,953,0001,167,0002,113,536
8May 18, 2026 18:3959,79431,550,76520,954,0001,170,0002,113,536
9May 18, 2026 18:3959,84535,654,21821,059,0001,084,0002,113,536