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:38Pavel 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:38091,141,80271,388,0003,016,0002,486,272expected "2189187097 ", got " "stderr
2May 2, 2026 12:38090,209,52372,530,0002,014,0002,363,392expected "2084131275 ", got " "stderr
3May 2, 2026 12:38089,159,55871,026,0003,001,0002,547,712expected "1996703304 ", got " "stderr