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:28highload-churnerhighload-churnerScore: 55,394Success
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:2855,24329,624,90520,440,000020,480
2Oct 11, 2026 05:2855,33529,322,96120,474,000020,480
3Oct 11, 2026 05:2855,35129,533,73920,480,000020,480
4Oct 11, 2026 05:2855,35629,473,64220,482,000020,480
5Oct 11, 2026 05:2855,39429,538,35420,496,000020,480
6Oct 11, 2026 05:2855,43529,549,95220,511,000020,480
7Oct 11, 2026 05:2855,44529,497,60720,515,000020,480
8Oct 11, 2026 05:2855,62429,624,18820,581,000020,480
9Oct 11, 2026 05:2855,72929,572,16320,620,000020,480