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:40highload-churnerhighload-churnerScore: 2,320,618Success
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:422,312,762865,251,513852,458,0003,264,00028,672stderr
2Oct 13, 2026 08:422,313,948865,195,051852,923,0003,238,00024,576stderr
3Oct 13, 2026 08:422,316,470866,083,746853,975,0003,119,00028,672stderr
4Oct 13, 2026 08:422,317,175866,286,425853,168,0004,187,00024,576stderr
5Oct 13, 2026 08:422,320,618867,590,930855,382,0003,247,00028,672stderr
6Oct 13, 2026 08:422,322,156868,232,604854,837,0004,361,00024,576stderr
7Oct 13, 2026 08:422,323,181868,559,386856,451,0003,126,00024,576stderr
8Oct 13, 2026 08:422,323,383868,879,966856,365,0003,287,00024,576stderr
9Oct 13, 2026 08:422,329,202870,809,142858,661,0003,144,00024,576stderr