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 21, 2026 18:38M-RochatM-RochatScore: 59,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:3959,40831,224,36220,849,0001,132,0002,113,536
2May 21, 2026 18:3959,45931,570,59420,912,0001,088,0002,113,536
3May 21, 2026 18:3959,49134,151,36020,856,0001,156,0002,113,536
4May 21, 2026 18:3959,49731,596,39620,946,0001,068,0002,113,536
5May 21, 2026 18:3959,58132,119,52720,898,0001,147,0002,113,536
6May 21, 2026 18:3959,61032,887,90120,984,0001,072,0002,113,536
7May 21, 2026 18:3959,68332,700,23420,939,0001,144,0002,113,536
8May 21, 2026 18:3959,73531,401,18621,036,0001,066,0002,113,536
9May 21, 2026 18:3959,74033,411,70420,934,0001,170,0002,113,536