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 11, 2026 23:46Victor MerckléVictor MerckléScore: 64,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 23:4764,38134,352,15822,783,0001,038,0002,113,536
2May 11, 2026 23:4764,60834,377,86222,805,0001,100,0002,113,536
3May 11, 2026 23:4764,64332,663,90322,839,0001,079,0002,113,536
4May 11, 2026 23:4764,68932,726,48722,839,0001,096,0002,113,536
5May 11, 2026 23:4764,72134,762,08322,851,0001,096,0002,113,536
6May 11, 2026 23:4764,95434,632,81422,927,0001,106,0002,113,536
7May 11, 2026 23:4765,10834,995,75022,980,0001,110,0002,113,536
8May 11, 2026 23:4765,18634,349,52622,978,0001,141,0002,113,536
9May 11, 2026 23:4765,66735,321,91423,163,0001,134,0002,113,536