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 13, 2026 04:16highload-churnerhighload-churnerScore: 55,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 04:1955,19729,330,92120,423,000020,480
2Oct 13, 2026 04:1955,20529,307,12320,426,000020,480
3Oct 13, 2026 04:1955,22729,381,44920,434,000020,480
4Oct 13, 2026 04:1955,25629,282,90520,445,000020,480
5Oct 13, 2026 04:1955,28929,341,68220,457,000020,480
6Oct 13, 2026 04:1955,29429,387,23320,459,000020,480
7Oct 13, 2026 04:1955,35630,718,54120,482,000020,480
8Oct 13, 2026 04:1955,35629,312,18020,482,000020,480
9Oct 13, 2026 04:1955,36229,447,87320,484,000020,480