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 13:54highload-churnerhighload-churnerScore: 55,756Success
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 13:5555,59131,562,16320,569,000020,480
2Oct 11, 2026 13:5555,60829,427,19620,575,000020,480
3Oct 11, 2026 13:5555,65929,512,30420,594,000020,480
4Oct 11, 2026 13:5555,67529,443,88020,600,000020,480
5Oct 11, 2026 13:5555,75629,595,10220,630,000020,480
6Oct 11, 2026 13:5555,76729,521,58920,634,000020,480
7Oct 11, 2026 13:5555,83229,591,25020,658,000020,480
8Oct 11, 2026 13:5555,83729,656,86220,660,000020,480
9Oct 11, 2026 13:5556,00529,636,79619,708,0001,014,00020,480