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 13, 2026 09:03highload-churnerhighload-churnerScore: 2,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 09:042,51131,001,95620,591,000020,480
2Oct 13, 2026 09:042,51129,594,44220,593,000020,480
3Oct 13, 2026 09:042,51329,522,19920,608,000020,480
4Oct 13, 2026 09:042,51629,584,44320,634,000020,480
5Oct 13, 2026 09:042,51729,627,72020,646,000020,480
6Oct 13, 2026 09:042,51729,806,84520,644,000020,480
7Oct 13, 2026 09:042,51829,687,35420,651,000020,480
8Oct 13, 2026 09:042,53929,772,14919,807,0001,020,00020,480
9Oct 13, 2026 09:042,56930,038,49921,072,000020,480