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 listJun 24, 2026 10:15Victor MerckléVictor MerckléScore: 86,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:1685,91639,407,38322,366,0009,423,0002,113,536
2Jun 24, 2026 10:1686,02939,274,26022,565,0009,266,0002,113,536
3Jun 24, 2026 10:1686,12739,319,39822,399,0009,468,0002,113,536
4Jun 24, 2026 10:1686,54339,440,65522,519,0009,502,0002,113,536
5Jun 24, 2026 10:1686,83539,791,24522,329,0009,800,0002,113,536
6Jun 24, 2026 10:1687,37240,256,99823,402,0008,926,0002,113,536
7Jun 24, 2026 10:1687,84840,154,01822,734,0009,770,0002,113,536
8Jun 24, 2026 10:1688,35140,480,61222,548,00010,142,0002,113,536
9Jun 24, 2026 10:16176,58672,814,17854,788,00010,549,0002,113,536