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 listOct 11, 2026 22:21highload-churnerhighload-churnerScore: 55,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 22:2254,88929,410,22520,309,000020,480
2Oct 11, 2026 22:2254,98329,282,62720,344,000020,480
3Oct 11, 2026 22:2255,01629,111,43020,356,000020,480
4Oct 11, 2026 22:2255,15429,097,88820,407,000020,480
5Oct 11, 2026 22:2255,15429,289,54120,407,000020,480
6Oct 11, 2026 22:2255,15429,166,01120,407,000020,480
7Oct 11, 2026 22:2255,19129,591,54120,421,000020,480
8Oct 11, 2026 22:2255,20529,376,08420,426,000020,480
9Oct 11, 2026 22:2255,21329,359,38920,429,000020,480