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 21:55Victor MerckléVictor MerckléScore: 65,494Success
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 21:5765,24332,944,59723,128,0001,012,0002,113,536
2May 11, 2026 21:5765,30033,210,45523,078,0001,083,0002,113,536
3May 11, 2026 21:5765,31633,317,41823,085,0001,082,0002,113,536
4May 11, 2026 21:5765,48333,426,70523,135,0001,094,0002,113,536
5May 11, 2026 21:5765,49435,582,73423,140,0001,093,0002,113,536
6May 11, 2026 21:5765,71633,215,28323,269,0001,046,0002,113,536
7May 11, 2026 21:5765,72933,087,54123,266,0001,054,0002,113,536
8May 11, 2026 21:5765,92733,074,77623,289,0001,104,0002,113,536
9May 11, 2026 21:5766,72734,703,83523,616,0001,073,0002,113,536