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 listMay 11, 2026 18:42Victor MerckléVictor MerckléScore: 3,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:433,46238,230,17127,360,0001,030,0002,113,536
2May 11, 2026 18:433,48439,110,44027,510,0001,061,0002,113,536
3May 11, 2026 18:433,50038,353,97227,638,0001,062,0002,113,536
4May 11, 2026 18:433,50837,765,24127,717,0001,054,0002,113,536
5May 11, 2026 18:433,52337,681,69027,825,0001,064,0002,113,536
6May 11, 2026 18:433,54138,645,97127,976,0001,067,0002,113,536
7May 11, 2026 18:433,91841,603,88530,080,0002,054,0002,113,536
8May 11, 2026 18:4338,700329,033,597315,338,0002,010,0002,113,536
9May 11, 2026 18:4339,235331,143,003319,719,0002,008,0002,113,536