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 16, 2026 15:47M-RochatM-RochatError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 15:48011,541,570812,00002,117,632expected "2028287776 ", got "1456853030 "
2May 16, 2026 15:4809,428,742806,00002,117,632expected "2260722795 ", got "4162016844 "
3May 16, 2026 15:4809,391,950896,00002,117,632expected "2031740657 ", got "2193231694 "