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 listMar 28, 2026 21:29Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:07Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:17020,248,5915,530,0004,246,00020,480No answer to stdout. Died or killed?
2Mar 28, 2026 21:296,81683,886,45952,894,0002,994,0002,387,968
3Mar 28, 2026 21:296,83983,189,38753,079,0003,004,0002,367,488
4Mar 28, 2026 21:296,84480,699,15754,120,0002,004,0002,289,664
5Mar 28, 2026 21:296,85679,665,88855,219,0001,003,0002,461,696
6Mar 28, 2026 21:296,86478,448,19353,269,0003,015,0002,289,664
7Mar 28, 2026 21:296,94280,259,37853,928,0002,996,0002,408,448
8Mar 28, 2026 21:299,847106,682,94279,752,000996,0002,383,872
9Mar 28, 2026 21:299,878102,619,88978,999,0001,999,0002,379,776
10Mar 28, 2026 21:2910,048106,081,33280,382,0002,009,0002,334,720