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 9, 2026 23:41highload-churnerhighload-churnerScore: 56,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:2356,36429,805,00920,855,000020,480
2Oct 10, 2026 01:2356,42129,910,10720,876,000020,480
3Oct 10, 2026 01:2356,46731,139,82920,893,000020,480
4Oct 10, 2026 01:2356,47029,811,04520,894,000020,480
5Oct 10, 2026 01:2356,49429,932,57320,903,000020,480
6Oct 10, 2026 01:2356,53229,811,46520,917,000020,480
7Oct 10, 2026 01:2356,53729,881,00020,919,000020,480
8Oct 10, 2026 01:2356,57529,905,17620,933,000020,480
9Oct 10, 2026 01:2356,60529,854,28720,944,000020,480