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 13, 2026 08:33highload-churnerhighload-churnerScore: 54,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 08:3354,46729,010,64720,153,000020,480
2Oct 13, 2026 08:3354,47529,064,48920,156,000020,480
3Oct 13, 2026 08:3354,49129,043,15020,162,000020,480
4Oct 13, 2026 08:3354,57029,095,35720,191,000020,480
5Oct 13, 2026 08:3354,62929,132,58120,213,000020,480
6Oct 13, 2026 08:3354,64329,191,37620,218,000020,480
7Oct 13, 2026 08:3354,66429,200,80720,226,000020,480
8Oct 13, 2026 08:3354,66429,080,27820,226,000020,480
9Oct 13, 2026 08:3354,66729,053,81020,227,000020,480