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 04:23highload-churnerhighload-churnerScore: 55,870Success
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 04:2655,45929,391,51220,520,000020,480
2Oct 13, 2026 04:2655,49430,896,96220,533,000020,480
3Oct 13, 2026 04:2655,79731,265,11420,645,000020,480
4Oct 13, 2026 04:2655,80229,394,04620,647,000020,480
5Oct 13, 2026 04:2655,87029,643,63320,672,000020,480
6Oct 13, 2026 04:2655,99129,557,10520,717,000020,480
7Oct 13, 2026 04:2656,09429,657,73620,755,000020,480
8Oct 13, 2026 04:2656,23729,713,21620,808,000020,480
9Oct 13, 2026 04:2656,33529,738,68220,844,000020,480