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:21highload-churnerhighload-churnerScore: 1,839,245Success
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:231,833,637687,366,729676,371,0002,075,00024,576stderr
2Oct 13, 2026 08:231,833,956687,426,266676,509,0002,055,00024,576stderr
3Oct 13, 2026 08:231,834,583687,766,252676,676,0002,120,00024,576stderr
4Oct 13, 2026 08:231,838,827689,189,329678,340,0002,026,00024,576stderr
5Oct 13, 2026 08:231,839,245690,065,124678,495,0002,026,00024,576stderr
6Oct 13, 2026 08:231,839,681689,605,917678,642,0002,040,00024,576stderr
7Oct 13, 2026 08:231,840,216689,743,887678,733,0002,147,00024,576stderr
8Oct 13, 2026 08:231,841,689690,207,798679,401,0002,024,00028,672stderr
9Oct 13, 2026 08:231,842,370690,602,383679,611,0002,066,00024,576stderr