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 7, 2026 11:56IlyaIlyaScore: 59,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 11:5758,79431,334,56720,624,0001,130,0002,113,536
2Jul 7, 2026 11:5758,92731,455,17620,675,0001,128,0002,113,536
3Jul 7, 2026 11:5758,99431,541,25020,695,0001,133,0002,113,536
4Jul 7, 2026 11:5759,16232,181,54820,669,0001,221,0002,113,536
5Jul 7, 2026 11:5759,17031,431,76120,774,0001,119,0002,113,536
6Jul 7, 2026 11:5759,23231,544,26220,700,0001,216,0002,113,536
7Jul 7, 2026 11:5759,27031,721,92520,729,0001,201,0002,113,536
8Jul 7, 2026 11:5759,27831,611,24720,727,0001,206,0002,113,536
9Jul 7, 2026 11:5759,33732,229,41620,709,0001,246,0002,113,536