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 15:40highload-churnerhighload-churnerScore: 54,981Success
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 15:4154,83229,193,43020,288,000020,480
2Oct 12, 2026 15:4154,84829,192,36220,294,000020,480
3Oct 12, 2026 15:4154,94029,832,39320,328,000020,480
4Oct 12, 2026 15:4154,97829,228,76620,342,000020,480
5Oct 12, 2026 15:4154,98129,178,69520,343,000020,480
6Oct 12, 2026 15:4155,08929,105,38920,383,000020,480
7Oct 12, 2026 15:4155,12129,280,09520,395,000020,480
8Oct 12, 2026 15:4155,12929,339,06820,398,000020,480
9Oct 12, 2026 15:4155,45929,389,28420,520,000020,480