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 listSep 5, 2022 10:17Eugene ZhydzetskiEugene ZhydzetskiError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:31Tomislav Tunkovic66.87CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:310241,092,500223,812,0008,525,00040,960expected "4294967295 ", got "0 "
2Sep 9, 2026 10:310239,615,751223,222,0007,526,00040,960expected "4294967295 ", got "0 "
3Sep 9, 2026 10:310237,936,434221,360,0007,763,00045,056expected "651144 ", got "0 "
4Sep 5, 2022 10:1722,515248,154,513184,619,38602,199,552
5Sep 5, 2022 10:1723,485248,219,637192,576,97302,187,264
6Sep 5, 2022 10:1723,787264,545,665195,054,74502,199,552