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 20:31Victor MerckléVictor MerckléScore: 2,674Success
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 20:342,65330,215,29021,759,000024,576stderr
2Sep 8, 2026 20:342,66230,124,15021,831,000024,576stderr
3Sep 8, 2026 20:342,66630,096,81621,863,000024,576stderr
4Sep 8, 2026 20:342,67230,319,59221,913,000024,576stderr
5Sep 8, 2026 20:342,67430,251,50621,927,000024,576stderr
6Sep 8, 2026 20:342,71931,734,22722,301,000024,576stderr
7Sep 8, 2026 20:342,72630,594,75822,355,000024,576stderr
8Sep 8, 2026 20:342,74431,605,86322,504,000024,576stderr
9Sep 8, 2026 20:345,53753,628,77444,396,0001,015,00024,576stderr