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 listSep 19, 2026 19:17Andrew EpsteinAndrew EpsteinScore: 45,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:1745,572384,049,238372,670,0001,024,0002,117,632stderr
2Sep 19, 2026 19:1745,572384,200,183372,691,0001,004,0002,117,632stderr
3Sep 19, 2026 19:1745,642385,381,499373,244,0001,028,0002,117,632stderr
4Sep 19, 2026 19:1745,676385,099,172373,548,0001,003,0002,117,632stderr
5Sep 19, 2026 19:1745,790385,966,461374,480,0001,006,0002,117,632stderr
6Sep 19, 2026 19:1745,956387,717,219375,845,0001,002,0002,117,632stderr
7Sep 19, 2026 19:1746,059388,178,622376,666,0001,023,0002,117,632stderr
8Sep 19, 2026 19:1746,276389,865,855378,461,0001,006,0002,117,632stderr
9Sep 19, 2026 19:1746,892394,932,379383,514,0001,002,0002,117,632stderr