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:10Victor MerckléVictor MerckléScore: 2,626Success
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:112,56629,526,22821,047,000024,576stderr
2Sep 8, 2026 20:112,56829,543,95921,061,000024,576stderr
3Sep 8, 2026 20:112,56829,441,83021,058,000024,576stderr
4Sep 8, 2026 20:112,62430,001,05121,524,000024,576stderr
5Sep 8, 2026 20:112,62630,060,47721,540,000024,576stderr
6Sep 8, 2026 20:112,63930,091,29321,647,000024,576stderr
7Sep 8, 2026 20:112,65530,852,58221,775,000024,576stderr
8Sep 8, 2026 20:112,69631,234,90022,111,000024,576stderr
9Sep 8, 2026 20:115,50357,911,67444,107,0001,018,00024,576stderr