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:44Pavel 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:44097,274,90775,478,0002,012,0002,420,736expected "2250984886 ", got "0 "stderr
2May 2, 2026 12:44097,656,42974,885,0001,996,0002,301,952expected "2208220913 ", got "0 "stderr
3May 2, 2026 12:449,38292,035,73674,935,0001,998,0002,551,808stderr