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 8, 2026 07:06Victor MerckléVictor MerckléScore: 2,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 07:072,59029,595,62621,240,000024,576stderr
2Sep 8, 2026 07:072,59029,593,05421,241,000024,576stderr
3Sep 8, 2026 07:072,59329,648,58021,270,000024,576stderr
4Sep 8, 2026 07:072,59429,645,52221,277,000024,576stderr
5Sep 8, 2026 07:072,60129,728,43721,331,000024,576stderr
6Sep 8, 2026 07:072,60830,663,06721,386,000024,576stderr
7Sep 8, 2026 07:075,26951,461,35342,201,0001,008,00024,576stderr
8Sep 8, 2026 07:075,27752,406,04142,251,0001,022,00024,576stderr
9Sep 8, 2026 07:0711,537102,974,51593,601,0001,006,00024,576stderr