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:17zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:38Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:3908,949,0281,078,000020,480No answer to stdout. Died or killed?
2Oct 19, 2024 18:173,30647,602,94726,109,0001,004,0002,453,504
3Oct 19, 2024 18:173,34448,527,97924,374,0003,046,0002,375,680
4Oct 19, 2024 18:173,37155,359,88426,619,0001,023,0002,510,848