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:22Victor MerckléVictor MerckléScore: 63,216Success
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:2362,25130,692,19423,033,00002,113,536
2Jun 24, 2026 17:2362,64030,760,78223,177,00002,113,536
3Jun 24, 2026 17:2362,87530,973,56223,264,00002,113,536
4Jun 24, 2026 17:2363,15431,017,22523,367,00002,113,536
5Jun 24, 2026 17:2363,21631,049,66023,390,00002,113,536
6Jun 24, 2026 17:2363,43531,113,83822,440,0001,031,0002,113,536
7Jun 24, 2026 17:2363,59430,977,41523,530,00002,113,536
8Jun 24, 2026 17:2363,75431,655,54023,589,00002,113,536
9Jun 24, 2026 17:2363,82131,104,93623,614,00002,113,536