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 9, 2026 13:57highload-churnerhighload-churnerScore: 57,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 14:0357,22730,115,36220,164,0001,010,00020,480
2Oct 9, 2026 14:0357,24029,939,88220,168,0001,011,00020,480
3Oct 9, 2026 14:0357,28630,171,03620,176,0001,020,00020,480
4Oct 9, 2026 14:0357,39430,267,08420,221,0001,015,00020,480
5Oct 9, 2026 14:0357,45930,280,94920,247,0001,013,00020,480
6Oct 9, 2026 14:0357,47230,334,89520,252,0001,013,00020,480
7Oct 9, 2026 14:0357,65630,884,46820,315,0001,018,00020,480
8Oct 9, 2026 14:0358,14830,487,38720,452,0001,063,00020,480
9Oct 9, 2026 14:0358,60230,627,11120,670,0001,013,00020,480