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 11, 2026 05:49highload-churnerhighload-churnerScore: 55,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 05:5055,14529,380,62220,404,000020,480
2Oct 11, 2026 05:5055,19729,469,82120,423,000020,480
3Oct 11, 2026 05:5055,22729,449,99620,434,000020,480
4Oct 11, 2026 05:5055,22729,455,23720,434,000020,480
5Oct 11, 2026 05:5055,22930,781,12120,435,000020,480
6Oct 11, 2026 05:5055,36729,610,63720,486,000020,480
7Oct 11, 2026 05:5055,50529,570,23720,537,000020,480
8Oct 11, 2026 05:5055,52929,584,12920,546,000020,480
9Oct 11, 2026 05:5056,10529,828,13820,759,000020,480