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 14:18highload-churnerhighload-churnerScore: 55,743Success
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 14:1955,54829,547,75820,553,000020,480
2Oct 11, 2026 14:1955,61629,494,92420,578,000020,480
3Oct 11, 2026 14:1955,63229,454,50720,584,000020,480
4Oct 11, 2026 14:1955,68331,083,55920,603,000020,480
5Oct 11, 2026 14:1955,74329,448,12220,625,000020,480
6Oct 11, 2026 14:1955,75129,610,41920,628,000020,480
7Oct 11, 2026 14:1955,76729,697,10820,634,000020,480
8Oct 11, 2026 14:1955,81029,497,84720,650,000020,480
9Oct 11, 2026 14:1955,82929,549,31620,657,000020,480