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 10, 2026 03:07Andrew EpsteinAndrew EpsteinScore: 5,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 03:075,72157,901,07543,854,0003,063,0002,117,632stderr
2Sep 10, 2026 03:075,72257,245,87843,876,0003,049,0002,117,632stderr
3Sep 10, 2026 03:075,74957,330,56844,082,0003,062,0002,117,632stderr
4Sep 10, 2026 03:075,76658,247,46844,159,0003,127,0002,117,632stderr
5Sep 10, 2026 03:075,83058,106,61344,676,0003,137,0002,117,632stderr
6Sep 10, 2026 03:075,83658,841,27444,650,0003,212,0002,117,632stderr
7Sep 10, 2026 03:075,84458,239,06544,818,0003,110,0002,117,632stderr
8Sep 10, 2026 03:075,85658,309,66244,802,0003,225,0002,117,632stderr
9Sep 10, 2026 03:075,88259,276,55945,092,0003,144,0002,117,632stderr