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 3, 2026 01:32Karthik ReddyKarthik ReddyScore: 2,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:332,48329,345,71120,363,000020,480
2Oct 3, 2026 01:332,48829,364,15920,405,000020,480
3Oct 3, 2026 01:332,48829,435,61520,402,000020,480
4Oct 3, 2026 01:332,55530,036,83719,934,0001,023,00020,480
5Oct 3, 2026 01:332,63930,660,30420,133,0001,507,00020,480
6Oct 3, 2026 01:332,73131,371,22220,367,0002,034,00020,480
7Oct 3, 2026 01:332,75931,653,41720,458,0002,171,00020,480
8Oct 3, 2026 01:332,79031,939,95719,631,0003,253,00020,480
9Oct 3, 2026 01:333,04234,017,61319,642,0005,308,00020,480