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 17, 2026 11:53M-RochatM-RochatScore: 60,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:5660,32731,188,44321,317,0001,004,0002,113,536
2May 17, 2026 11:5660,44532,276,88221,349,0001,016,0002,113,536
3May 17, 2026 11:5660,45133,643,86021,348,0001,019,0002,113,536
4May 17, 2026 11:5660,47034,227,37921,355,0001,019,0002,113,536
5May 17, 2026 11:5660,53231,189,21021,301,0001,096,0002,113,536
6May 17, 2026 11:5660,66733,865,95721,422,0001,025,0002,113,536
7May 17, 2026 11:5660,85931,925,25421,423,0001,095,0002,113,536
8May 17, 2026 11:5660,87833,230,73921,453,0001,072,0002,113,536
9May 17, 2026 11:5661,00032,410,28121,477,0001,093,0002,113,536