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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:44012,683,2652,324,0001,160,00020,480No answer to stdout. Died or killed?
2Mar 28, 2026 21:443,89354,549,21528,933,0002,993,0002,510,848
3Mar 28, 2026 21:443,94560,014,08931,340,0001,010,0002,367,488
4Mar 28, 2026 21:4413,453132,894,426108,310,0002,005,0002,461,696