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 listApr 25, 2026 08:18limanjun99limanjun99Error
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 30, 2026 22:20Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2026 22:22012,846,8521,038,0001,092,00020,480No answer to stdout. Died or killed?
2Apr 25, 2026 08:184,05151,656,13731,207,0002,013,0002,469,888
3Apr 25, 2026 08:184,08350,260,34031,457,0002,029,0002,469,888
4Apr 25, 2026 08:184,14648,697,45033,004,0001,000,0002,469,888