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 18:42Victor MerckléVictor MerckléScore: 165,708Success
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 18:43164,32469,973,31014,111,00046,689,0002,113,536
2Jun 24, 2026 18:43164,98670,136,73013,334,00047,711,0002,113,536
3Jun 24, 2026 18:43165,06470,229,12312,986,00048,088,0002,113,536
4Jun 24, 2026 18:43165,14070,333,92514,258,00046,844,0002,113,536
5Jun 24, 2026 18:43165,70870,438,90813,284,00048,028,0002,113,536
6Jun 24, 2026 18:43165,75970,463,76713,352,00047,979,0002,113,536
7Jun 24, 2026 18:43166,35670,609,31013,688,00047,864,0002,113,536
8Jun 24, 2026 18:43167,78971,194,30414,491,00047,591,0002,113,536
9Jun 24, 2026 18:43168,76271,659,48815,279,00047,163,0002,113,536