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 12, 2026 13:47highload-churnerhighload-churnerScore: 66,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 13:4866,19733,366,31124,493,000020,480
2Oct 12, 2026 13:4866,33233,438,67424,543,000020,480
3Oct 12, 2026 13:4866,37033,466,72524,557,000020,480
4Oct 12, 2026 13:4866,52733,419,47624,615,000020,480
5Oct 12, 2026 13:4866,62733,548,65824,652,000020,480
6Oct 12, 2026 13:4866,75134,991,69724,698,000020,480
7Oct 12, 2026 13:4866,76433,572,60224,703,000020,480
8Oct 12, 2026 13:4866,81033,612,75124,720,000020,480
9Oct 12, 2026 13:4867,01833,649,25624,797,000020,480