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 10, 2026 00:01highload-churnerhighload-churnerScore: 56,245Success
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:3756,08929,749,77420,753,000020,480
2Oct 10, 2026 01:3756,15129,784,84820,776,000020,480
3Oct 10, 2026 01:3756,22729,851,88020,804,000020,480
4Oct 10, 2026 01:3756,23529,779,81920,807,000020,480
5Oct 10, 2026 01:3756,24529,824,00720,811,000024,576
6Oct 10, 2026 01:3756,27829,812,81220,823,000020,480
7Oct 10, 2026 01:3756,31830,406,61320,838,000020,480
8Oct 10, 2026 01:3756,40229,947,41920,869,000020,480
9Oct 10, 2026 01:3756,57029,951,15319,916,0001,015,00020,480