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 listOct 18, 2024 00:06zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:46Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:4608,756,0951,054,000020,480No answer to stdout. Died or killed?
2Oct 18, 2024 00:063,43355,891,03225,136,0003,016,0002,433,024
3Oct 18, 2024 00:063,43654,231,18326,160,0002,012,0002,301,952
4Oct 18, 2024 00:063,45751,101,53627,332,0001,012,0002,449,408