Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listOct 15, 2026 02:13highload-churnerhighload-churnerScore: 2,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 02:132,49329,516,08720,446,000020,480
2Oct 15, 2026 02:132,49529,417,58920,465,000020,480
3Oct 15, 2026 02:132,49529,526,34120,466,000020,480
4Oct 15, 2026 02:132,49629,544,83720,473,000020,480
5Oct 15, 2026 02:132,49629,491,94920,474,000020,480
6Oct 15, 2026 02:132,50029,557,20920,501,000020,480
7Oct 15, 2026 02:132,50429,569,78820,538,000020,480
8Oct 15, 2026 02:133,54738,021,05225,596,0003,490,00020,480
9Oct 15, 2026 02:135,92657,652,02645,555,0003,040,00020,480