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:16Victor MerckléVictor MerckléScore: 70,824Success
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:1770,66234,892,22824,980,0001,165,0002,113,536
2May 11, 2026 15:1770,67834,878,74824,944,0001,207,0002,113,536
3May 11, 2026 15:1770,70536,704,28924,944,0001,217,0002,113,536
4May 11, 2026 15:1770,75434,923,11725,028,0001,151,0002,113,536
5May 11, 2026 15:1770,82436,613,75424,994,0001,211,0002,113,536
6May 11, 2026 15:1770,84337,981,99225,051,0001,161,0002,113,536
7May 11, 2026 15:1770,99735,992,91325,115,0001,154,0002,113,536
8May 11, 2026 15:1771,04836,293,45725,124,0001,164,0002,113,536
9May 11, 2026 15:1771,06437,750,78425,091,0001,203,0002,113,536