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 2, 2026 12:43Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 12:44093,741,90773,757,0002,990,0002,428,928expected "2134600553 ", got "0 "stderr
2May 2, 2026 12:44096,175,64273,318,0003,013,0002,412,544expected "2134902293 ", got "0 "stderr
3May 2, 2026 12:44093,263,99871,614,0004,034,0002,408,448expected "2195282363 ", got "0 "stderr