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 16, 2026 04:23highload-churnerhighload-churnerScore: 53,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 04:2453,74828,894,02619,887,000020,480
2Oct 16, 2026 04:2453,75128,832,03419,888,000020,480
3Oct 16, 2026 04:2453,79428,850,41319,904,000020,480
4Oct 16, 2026 04:2453,80028,906,37619,906,000020,480
5Oct 16, 2026 04:2453,80228,898,08819,907,000020,480
6Oct 16, 2026 04:2453,82428,867,83619,915,000020,480
7Oct 16, 2026 04:2453,82728,881,01719,916,000020,480
8Oct 16, 2026 04:2453,87228,936,85919,933,000020,480
9Oct 16, 2026 04:2453,90028,888,42019,943,000020,480