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:31M-RochatM-RochatScore: 59,605Success
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:3259,43734,363,75020,918,0001,074,0002,113,536
2May 18, 2026 18:3259,52131,964,64320,859,0001,164,0002,113,536
3May 18, 2026 18:3259,52931,254,98720,874,0001,152,0002,113,536
4May 18, 2026 18:3259,54033,478,21921,019,0001,011,0002,113,536
5May 18, 2026 18:3259,60531,233,14420,981,0001,073,0002,113,536
6May 18, 2026 18:3259,60832,171,06420,888,0001,167,0002,113,536
7May 18, 2026 18:3259,64834,078,17820,908,0001,162,0002,113,536
8May 18, 2026 18:3259,77031,334,02220,952,0001,163,0002,113,536
9May 18, 2026 18:3259,85931,786,67421,137,0001,011,0002,113,536