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 12, 2026 14:31highload-churnerhighload-churnerScore: 89,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 14:3288,71641,700,31932,825,000020,480
2Oct 12, 2026 14:3288,82741,790,65732,866,000020,480
3Oct 12, 2026 14:3288,98941,764,16932,926,000020,480
4Oct 12, 2026 14:3289,17041,965,79232,993,000020,480
5Oct 12, 2026 14:3289,87242,163,81433,253,000020,480
6Oct 12, 2026 14:3290,42942,374,03633,459,000020,480
7Oct 12, 2026 14:3290,59142,450,78533,519,000020,480
8Oct 12, 2026 14:3290,71342,450,89033,564,000020,480
9Oct 12, 2026 14:3290,90242,536,12533,634,000020,480