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 1, 2026 17:09Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 17:100279,217,497258,176,0003,002,0002,519,040expected "2238304153 ", got "2238264494 "
2May 1, 2026 17:100277,733,696259,998,0002,999,0002,519,040expected "2212380822 ", got "2212411942 "
3May 1, 2026 17:100276,367,890258,147,0002,001,0002,514,944expected "2083909327 ", got "2083852290 "