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:12highload-churnerhighload-churnerScore: 1,735,208Success
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:131,731,051649,382,213638,482,0002,007,00024,576stderr
2Oct 13, 2026 08:131,731,143649,519,595638,432,0002,091,00028,672stderr
3Oct 13, 2026 08:131,732,297650,045,049638,747,0002,203,00024,576stderr
4Oct 13, 2026 08:131,734,643650,702,189639,798,0002,020,00024,576stderr
5Oct 13, 2026 08:131,735,208651,312,380639,865,0002,162,00024,576stderr
6Oct 13, 2026 08:131,736,348651,432,961640,289,0002,160,00024,576stderr
7Oct 13, 2026 08:131,736,918651,646,547640,647,0002,013,00024,576stderr
8Oct 13, 2026 08:131,737,167660,258,776640,743,0002,009,00024,576stderr
9Oct 13, 2026 08:131,738,108652,027,325640,943,0002,157,00024,576stderr