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 15:00Victor MerckléVictor MerckléScore: 74,083Success
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 15:0173,80536,867,55826,212,0001,096,0002,113,536
2May 11, 2026 15:0173,81036,827,68126,213,0001,097,0002,113,536
3May 11, 2026 15:0173,87538,175,89326,231,0001,103,0002,113,536
4May 11, 2026 15:0173,88338,857,13926,322,0001,015,0002,113,536
5May 11, 2026 15:0174,08336,905,18326,302,0001,109,0002,113,536
6May 11, 2026 15:0174,16237,414,06926,408,0001,032,0002,113,536
7May 11, 2026 15:0174,21636,167,16326,443,0001,017,0002,113,536
8May 11, 2026 15:0174,84038,071,00426,597,0001,094,0002,113,536
9May 11, 2026 15:0175,28638,302,65626,771,0001,085,0002,113,536