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 listDec 25, 2024 02:59Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:37Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 11:40038,247,76628,619,0001,182,00020,480No answer to stdout. Died or killed?stderr
2Dec 25, 2024 02:594,48860,189,45134,812,0001,989,0002,510,848
3Dec 25, 2024 02:594,51465,552,13035,017,0002,000,0002,510,848
4Dec 25, 2024 02:594,56563,268,99335,409,0002,023,0002,400,256