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 18:05highload-churnerhighload-churnerScore: 55,086Success
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 18:0654,94829,056,48020,331,000020,480
2Oct 11, 2026 18:0654,99729,267,00720,349,000020,480
3Oct 11, 2026 18:0654,99729,166,30220,349,000020,480
4Oct 11, 2026 18:0655,08329,275,91220,381,000020,480
5Oct 11, 2026 18:0655,08629,280,22820,382,000020,480
6Oct 11, 2026 18:0655,17529,314,59620,415,000020,480
7Oct 11, 2026 18:0655,17829,246,13020,416,000020,480
8Oct 11, 2026 18:0655,21029,311,08120,428,000020,480
9Oct 11, 2026 18:0655,21029,269,54920,428,000020,480