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 20, 2024 22:04zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:17Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:1708,825,9431,049,000020,480No answer to stdout. Died or killed?
2Oct 20, 2024 22:042,98052,077,89620,365,0004,073,0002,527,232
3Oct 20, 2024 22:042,99550,425,37124,556,00002,490,368
4Oct 20, 2024 22:043,03051,522,35923,854,000993,0002,428,928