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 13:37Andrew EpsteinAndrew EpsteinScore: 19,222Success
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:1019,192167,748,208154,317,0003,064,0002,125,824stderr
2Sep 19, 2026 14:1019,197168,051,619154,400,0003,016,0002,121,728stderr
3Sep 19, 2026 14:1019,199167,914,933154,402,0003,036,0002,125,824stderr
4Sep 19, 2026 14:1019,214167,964,361154,542,0003,018,0002,125,824stderr
5Sep 19, 2026 14:1019,222167,969,353154,609,0003,017,0002,125,824stderr
6Sep 19, 2026 14:1019,247168,309,066154,815,0003,017,0002,125,824stderr
7Sep 19, 2026 14:1019,256168,251,159154,881,0003,019,0002,125,824stderr
8Sep 19, 2026 14:1019,266168,317,606154,951,0003,034,0002,125,824stderr
9Sep 19, 2026 14:1019,299168,644,516155,235,0003,017,0002,125,824stderr