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 06:04highload-churnerhighload-churnerScore: 55,232Success
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 06:0555,05429,435,93620,370,000020,480
2Oct 11, 2026 06:0555,06430,923,71720,374,000020,480
3Oct 11, 2026 06:0555,14029,470,13320,402,000020,480
4Oct 11, 2026 06:0555,22729,443,49020,434,000020,480
5Oct 11, 2026 06:0555,23229,363,30420,436,000020,480
6Oct 11, 2026 06:0555,25929,412,11220,446,000020,480
7Oct 11, 2026 06:0555,29129,445,12120,458,000020,480
8Oct 11, 2026 06:0555,30529,684,86520,463,000020,480
9Oct 11, 2026 06:0555,32429,494,62320,470,000020,480