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 08:53highload-churnerhighload-churnerScore: 579,845Success
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 08:54578,500222,906,189212,036,0002,009,00024,576stderr
2Oct 13, 2026 08:54578,808223,088,271212,151,0002,008,00024,576stderr
3Oct 13, 2026 08:54578,870223,619,988212,172,0002,010,00028,672stderr
4Oct 13, 2026 08:54579,810223,396,385212,376,0002,154,00028,672stderr
5Oct 13, 2026 08:54579,845223,665,426213,386,0001,157,00028,672stderr
6Oct 13, 2026 08:54579,932223,541,974212,407,0002,168,00024,576stderr
7Oct 13, 2026 08:54580,854223,741,863212,738,0002,178,00028,672stderr
8Oct 13, 2026 08:54580,991223,693,059212,946,0002,021,00028,672stderr
9Oct 13, 2026 08:54582,435224,337,458213,476,0002,025,00024,576stderr