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 9, 2026 17:23Karthik ReddyKarthik ReddyScore: 2,543Success
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 17:462,53531,753,56820,790,000020,480
2Oct 9, 2026 17:462,53829,789,90820,818,000020,480
3Oct 9, 2026 17:462,54029,725,41420,836,000020,480
4Oct 9, 2026 17:462,54229,932,34520,848,000020,480
5Oct 9, 2026 17:462,54329,758,05920,853,000020,480
6Oct 9, 2026 17:462,54529,796,82620,875,000020,480
7Oct 9, 2026 17:462,54632,362,28019,876,0001,002,00020,480
8Oct 9, 2026 17:462,54930,506,80520,909,000020,480
9Oct 9, 2026 17:462,55129,899,86320,926,000020,480