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 03:02highload-churnerhighload-churnerScore: 56,232Success
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 03:0356,09729,741,62620,756,000020,480
2Oct 11, 2026 03:0356,11631,477,48820,763,000020,480
3Oct 11, 2026 03:0356,12729,735,78320,767,000020,480
4Oct 11, 2026 03:0356,19429,812,91820,792,000020,480
5Oct 11, 2026 03:0356,23229,824,47720,806,000020,480
6Oct 11, 2026 03:0356,27029,854,11820,820,000020,480
7Oct 11, 2026 03:0356,47829,859,46120,897,000020,480
8Oct 11, 2026 03:0356,52729,702,66720,915,000020,480
9Oct 11, 2026 03:0356,58329,897,11620,936,000020,480