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 listSep 7, 2026 17:44Victor MerckléVictor MerckléScore: 2,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:472,58829,634,53521,228,000024,576stderr
2Sep 7, 2026 17:472,59130,422,62221,253,000024,576stderr
3Sep 7, 2026 17:472,60130,499,62021,330,000024,576stderr
4Sep 7, 2026 17:472,60629,509,32121,376,000024,576stderr
5Sep 7, 2026 17:472,60931,194,95021,395,000024,576stderr
6Sep 7, 2026 17:472,61129,647,17320,377,0001,037,00024,576stderr
7Sep 7, 2026 17:475,26851,376,27742,190,0001,009,00024,576stderr
8Sep 7, 2026 17:475,27251,644,11642,215,0001,022,00024,576stderr
9Sep 7, 2026 17:475,31151,735,52042,532,0001,025,00024,576stderr