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 18:43Victor MerckléVictor MerckléScore: 2,562Success
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 18:452,55229,438,11420,931,000024,576stderr
2Sep 8, 2026 18:452,55429,392,43420,948,000024,576stderr
3Sep 8, 2026 18:452,55829,217,07920,982,000024,576stderr
4Sep 8, 2026 18:452,55829,161,77220,982,000024,576stderr
5Sep 8, 2026 18:452,56229,468,56921,012,000024,576stderr
6Sep 8, 2026 18:452,56729,501,56121,050,000024,576stderr
7Sep 8, 2026 18:452,65230,778,17521,747,000024,576stderr
8Sep 8, 2026 18:452,65630,947,07821,785,000024,576stderr
9Sep 8, 2026 18:455,48754,090,24343,981,0001,013,00024,576stderr