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 10, 2026 15:40Victor MerckléVictor MerckléScore: 63,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:4162,95930,796,04123,295,00002,113,536
2Jun 10, 2026 15:4163,04531,110,74123,327,00002,113,536
3Jun 10, 2026 15:4163,27531,136,13223,412,00002,113,536
4Jun 10, 2026 15:4163,31631,195,92123,427,00002,113,536
5Jun 10, 2026 15:4163,45131,244,84023,477,00002,113,536
6Jun 10, 2026 15:4163,48331,251,62723,489,00002,113,536
7Jun 10, 2026 15:4163,56731,253,51123,520,00002,113,536
8Jun 10, 2026 15:4163,62430,952,82123,541,00002,113,536
9Jun 10, 2026 15:4163,88931,339,60623,639,00002,113,536