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 30, 2026 17:56IlyaIlyaScore: 59,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 17:5758,85631,299,79120,666,0001,111,0002,113,536
2Jun 30, 2026 17:5759,01331,347,15720,738,0001,097,0002,113,536
3Jun 30, 2026 17:5759,23731,378,64620,805,0001,113,0002,113,536
4Jun 30, 2026 17:5759,24532,097,10020,729,0001,192,0002,113,536
5Jun 30, 2026 17:5759,30231,964,78420,729,0001,213,0002,113,536
6Jun 30, 2026 17:5759,31831,456,89220,669,0001,279,0002,113,536
7Jun 30, 2026 17:5759,45433,345,00120,779,0001,219,0002,113,536
8Jun 30, 2026 17:5759,45931,504,75220,795,0001,205,0002,113,536
9Jun 30, 2026 17:5759,60232,049,64220,808,0001,245,0002,113,536