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:40IlyaIlyaScore: 59,159Success
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:4659,05631,387,31220,679,0001,172,0002,113,536
2Jul 2, 2026 12:4659,07831,811,69720,672,0001,187,0002,113,536
3Jul 2, 2026 12:4659,09431,824,51120,671,0001,194,0002,113,536
4Jul 2, 2026 12:4659,14531,393,04020,670,0001,214,0002,113,536
5Jul 2, 2026 12:4659,15931,514,03420,672,0001,217,0002,113,536
6Jul 2, 2026 12:4659,16731,831,21120,707,0001,185,0002,113,536
7Jul 2, 2026 12:4659,28131,892,44220,716,0001,218,0002,113,536
8Jul 2, 2026 12:4659,31631,965,29720,748,0001,199,0002,113,536
9Jul 2, 2026 12:4659,63232,028,80320,969,0001,095,0002,113,536