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 19, 2024 18:18zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:48Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:4808,753,5571,049,000020,480No answer to stdout. Died or killed?
2Oct 19, 2024 18:183,95460,376,59628,371,0004,053,0002,322,432
3Oct 19, 2024 18:183,98364,055,26630,618,0002,041,0002,445,312
4Oct 19, 2024 18:184,00461,844,98829,851,0002,985,0002,310,144