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 12, 2026 13:28highload-churnerhighload-churnerScore: 56,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 13:2956,50829,803,37819,873,0001,035,00020,480
2Oct 12, 2026 13:2956,67230,008,66519,955,0001,014,00020,480
3Oct 12, 2026 13:2956,77829,857,57619,992,0001,016,00020,480
4Oct 12, 2026 13:2956,80529,808,23219,985,0001,033,00020,480
5Oct 12, 2026 13:2956,86430,112,04820,023,0001,017,00020,480
6Oct 12, 2026 13:2956,88129,956,94520,031,0001,015,00020,480
7Oct 12, 2026 13:2956,93229,952,05220,045,0001,020,00020,480
8Oct 12, 2026 13:2957,05429,987,86920,087,0001,023,00020,480
9Oct 12, 2026 13:2957,54330,062,75420,254,0001,037,00020,480