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 15:02highload-churnerhighload-churnerScore: 55,089Success
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 15:0354,99429,174,15420,348,000020,480
2Oct 12, 2026 15:0355,02729,209,33120,360,000020,480
3Oct 12, 2026 15:0355,05129,259,24420,369,000020,480
4Oct 12, 2026 15:0355,08129,112,26120,380,000020,480
5Oct 12, 2026 15:0355,08929,258,97920,383,000020,480
6Oct 12, 2026 15:0355,15929,376,27220,409,000020,480
7Oct 12, 2026 15:0355,22429,317,79220,433,000020,480
8Oct 12, 2026 15:0355,28629,354,99920,456,000020,480
9Oct 12, 2026 15:0355,67829,470,53020,601,000020,480