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 listApr 23, 2026 23:26olliecrowolliecrowScore: 12,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 23:2912,344119,446,82898,220,0003,006,0002,383,872
2Apr 23, 2026 23:2912,413109,969,19298,801,0002,993,0002,535,424
3Apr 23, 2026 23:2912,435110,238,70899,972,0001,999,0002,502,656
4Apr 23, 2026 23:2912,513109,940,273100,598,0002,011,0002,383,872
5Apr 23, 2026 23:2912,623111,688,004102,510,0001,005,0002,379,776
6Apr 23, 2026 23:2945,709383,630,833369,824,0004,997,0002,367,488
7Apr 23, 2026 23:2945,781383,872,717369,421,0005,990,0002,396,160
8Apr 23, 2026 23:2945,855383,878,058372,004,0004,010,0002,347,008
9Apr 23, 2026 23:2945,946385,332,396372,768,0003,997,0002,560,000