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 19, 2026 14:57Andrew EpsteinAndrew EpsteinScore: 27,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 14:5827,257233,947,976221,496,0002,015,0002,117,632stderr
2Sep 19, 2026 14:5827,295235,538,225221,810,0002,011,0002,117,632stderr
3Sep 19, 2026 14:5827,522236,058,987222,671,0003,012,0002,117,632stderr
4Sep 19, 2026 14:5827,709237,600,585225,202,0002,016,0002,117,632stderr
5Sep 19, 2026 14:5827,798238,380,004224,904,0003,045,0002,117,632stderr
6Sep 19, 2026 14:5827,864241,081,579225,335,0003,153,0002,117,632stderr
7Sep 19, 2026 14:5827,949239,651,865226,152,0003,030,0002,117,632stderr
8Sep 19, 2026 14:5828,166241,987,261228,953,0002,016,0002,117,632stderr
9Sep 19, 2026 14:5828,286243,083,410228,653,0003,296,0002,117,632stderr