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 3, 2026 22:08Josu San MartinJosu San MartinScore: 3,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:093,21836,265,92125,341,0001,048,0002,121,728stderr
2Sep 3, 2026 22:093,22336,318,57825,387,0001,048,0002,121,728stderr
3Sep 3, 2026 22:093,22336,339,91325,403,0001,029,0002,121,728stderr
4Sep 3, 2026 22:093,22636,352,27725,431,0001,025,0002,121,728stderr
5Sep 3, 2026 22:093,24836,897,87925,597,0001,037,0002,121,728stderr
6Sep 3, 2026 22:093,25136,675,45625,630,0001,033,0002,121,728stderr
7Sep 3, 2026 22:093,26236,632,38725,721,0001,028,0002,121,728stderr
8Sep 3, 2026 22:093,28836,845,88325,940,0001,028,0002,121,728stderr
9Sep 3, 2026 22:0915,393138,250,741125,211,0001,016,0002,121,728stderr