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 listJul 2, 2026 12:20IlyaIlyaScore: 59,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:2358,98631,277,00420,621,0001,204,0002,113,536
2Jul 2, 2026 12:2358,99731,307,04620,700,0001,129,0002,113,536
3Jul 2, 2026 12:2359,03231,827,47020,647,0001,195,0002,113,536
4Jul 2, 2026 12:2359,14831,818,26120,698,0001,187,0002,113,536
5Jul 2, 2026 12:2359,20831,824,97820,694,0001,213,0002,113,536
6Jul 2, 2026 12:2359,25431,911,60220,690,0001,234,0002,113,536
7Jul 2, 2026 12:2359,25631,941,23720,678,0001,247,0002,113,536
8Jul 2, 2026 12:2359,29731,438,12020,751,0001,189,0002,113,536
9Jul 2, 2026 12:2359,44531,949,69620,926,0001,069,0002,113,536