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 17:47Victor MerckléVictor MerckléScore: 247,016Success
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 17:48244,73599,724,94343,626,00046,926,0002,113,536
2Jun 24, 2026 17:48245,548100,607,84543,873,00046,980,0002,113,536
3Jun 24, 2026 17:48245,58399,982,88243,687,00047,179,0002,113,536
4Jun 24, 2026 17:48246,337100,261,12744,300,00046,845,0002,113,536
5Jun 24, 2026 17:48247,016100,532,21844,105,00047,291,0002,113,536
6Jun 24, 2026 17:48247,227100,537,19144,039,00047,435,0002,113,536
7Jun 24, 2026 17:48247,235100,580,42543,940,00047,537,0002,113,536
8Jun 24, 2026 17:48247,770100,993,14344,239,00047,436,0002,113,536
9Jun 24, 2026 17:48251,397102,133,62444,504,00048,513,0002,113,536