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:38Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:17Victor Mercklé132.17CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:17012,853,5012,360,0001,179,00020,480No answer to stdout. Died or killed?
2Mar 28, 2026 21:383,50256,140,83026,665,0002,051,0002,494,464
3Mar 28, 2026 21:383,59955,915,39927,473,0002,035,0002,326,528
4Mar 28, 2026 21:3812,903132,761,189103,805,0001,996,0002,375,680