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 listDec 25, 2024 02:38Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:41Tomislav Tunkovic82.44CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 11:41034,934,83525,422,0001,173,00020,480No answer to stdout. Died or killed?stderr
2Dec 25, 2024 02:384,21557,010,38732,527,0002,032,0002,293,760
3Dec 25, 2024 02:384,25061,186,03332,861,0001,991,0002,396,160
4Dec 25, 2024 02:384,29056,370,64534,174,0001,005,0002,392,064