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 16, 2026 04:33highload-churnerhighload-churnerScore: 53,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 04:3453,48328,768,95719,789,000020,480
2Oct 16, 2026 04:3453,51328,754,85319,800,000020,480
3Oct 16, 2026 04:3453,52928,831,28219,806,000020,480
4Oct 16, 2026 04:3453,53728,797,57219,809,000020,480
5Oct 16, 2026 04:3453,60028,810,62919,832,000020,480
6Oct 16, 2026 04:3453,61328,854,87919,837,000020,480
7Oct 16, 2026 04:3453,61829,343,39719,839,000020,480
8Oct 16, 2026 04:3453,65128,825,10419,851,000020,480
9Oct 16, 2026 04:3454,09129,030,81720,014,000020,480