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 25, 2026 04:56Victor MerckléVictor MerckléScore: 58,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 04:5758,04828,951,25721,478,00002,113,536
2Jun 25, 2026 04:5758,20829,543,00720,508,0001,029,0002,113,536
3Jun 25, 2026 04:5758,21329,242,58520,511,0001,028,0002,113,536
4Jun 25, 2026 04:5758,26229,106,39020,521,0001,036,0002,113,536
5Jun 25, 2026 04:5758,27529,027,88120,543,0001,019,0002,113,536
6Jun 25, 2026 04:5758,29729,188,91321,570,00002,113,536
7Jun 25, 2026 04:5758,36429,167,49620,564,0001,031,0002,113,536
8Jun 25, 2026 04:5758,44529,102,77020,619,0001,006,0002,113,536
9Jun 25, 2026 04:5759,07029,696,01720,811,0001,045,0002,113,536