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 listJan 2, 2026 06:24Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 30, 2026 22:05Andrew Epstein64.93CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2026 22:06038,518,36023,409,0004,103,00016,384No answer to stdout. Died or killed?
2Jan 2, 2026 06:244,75262,373,99733,968,0004,995,0002,457,600
3Jan 2, 2026 06:244,76063,430,72733,024,0006,004,0002,404,352
4Oct 30, 2026 22:0652,734443,472,659341,347,00091,078,0002,117,632stderr
5Oct 30, 2026 22:0656,310473,309,343370,815,00090,928,0002,117,632stderr
6Jan 2, 2026 06:24101,138859,930,162711,424,000117,904,0002,445,312