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 17:07Victor MerckléVictor MerckléScore: 2,575Success
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 17:112,55029,289,09020,917,000024,576stderr
2Sep 8, 2026 17:112,55129,343,87420,921,000024,576stderr
3Sep 8, 2026 17:112,55329,347,92620,942,000024,576stderr
4Sep 8, 2026 17:112,55929,366,18920,984,000024,576stderr
5Sep 8, 2026 17:112,57529,645,88221,118,000024,576stderr
6Sep 8, 2026 17:112,61229,784,08621,426,000024,576stderr
7Sep 8, 2026 17:112,62029,685,07421,488,000024,576stderr
8Sep 8, 2026 17:112,62230,579,31221,502,000024,576stderr
9Sep 8, 2026 17:112,62629,882,11421,534,000024,576stderr