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 05:30highload-churnerhighload-churnerScore: 2,398,478Success
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 05:312,391,340893,837,752882,785,0002,011,00024,576stderr
2Oct 13, 2026 05:312,391,875894,049,077882,873,0002,121,00024,576stderr
3Oct 13, 2026 05:312,392,940894,692,465883,339,0002,049,00024,576stderr
4Oct 13, 2026 05:312,395,816895,801,013884,242,0002,210,00024,576stderr
5Oct 13, 2026 05:312,398,478896,367,083885,329,0002,108,00024,576stderr
6Oct 13, 2026 05:312,399,708897,397,658885,783,0002,109,00024,576stderr
7Oct 13, 2026 05:312,400,432897,325,579885,978,0002,182,00024,576stderr
8Oct 13, 2026 05:312,401,556897,611,013886,572,0002,004,00024,576stderr
9Oct 13, 2026 05:312,404,732898,692,854887,590,0002,161,00024,576stderr