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 03:37highload-churnerhighload-churnerScore: 55,905Success
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 03:3855,73529,584,48620,622,000020,480
2Oct 11, 2026 03:3855,81329,568,67420,651,000020,480
3Oct 11, 2026 03:3855,83229,603,45820,658,000020,480
4Oct 11, 2026 03:3855,85131,061,09320,665,000020,480
5Oct 11, 2026 03:3855,90529,647,21320,685,000020,480
6Oct 11, 2026 03:3855,91629,634,79120,689,000020,480
7Oct 11, 2026 03:3855,93229,637,44520,695,000020,480
8Oct 11, 2026 03:3856,00229,699,11720,721,000020,480
9Oct 11, 2026 03:3857,32930,136,93821,212,000020,480