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 15:28highload-churnerhighload-churnerScore: 55,170Success
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 15:2955,07829,175,39020,379,000020,480
2Oct 11, 2026 15:2955,09729,259,57320,386,000020,480
3Oct 11, 2026 15:2955,15129,432,56220,406,000020,480
4Oct 11, 2026 15:2955,15129,173,90520,406,000020,480
5Oct 11, 2026 15:2955,17029,192,10220,413,000020,480
6Oct 11, 2026 15:2955,18629,251,90920,419,000020,480
7Oct 11, 2026 15:2955,30529,244,19120,463,000020,480
8Oct 11, 2026 15:2955,32929,228,20320,472,000020,480
9Oct 11, 2026 15:2955,33229,309,55520,473,000020,480