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 listNov 11, 2024 07:29Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:27Tomislav Tunkovic15.40CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:270100,366,67882,232,0008,936,00016,384No answer to stdout. Died or killed?
2Nov 11, 2024 07:296,12470,057,73748,207,0002,008,0002,473,984
3Sep 9, 2026 10:276,23360,394,01542,636,0008,482,00020,480
4Nov 11, 2024 07:298,15488,434,21262,874,0003,992,0002,482,176
5Nov 11, 2024 07:298,68593,580,50865,196,0006,018,0002,445,312