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 16:40Victor MerckléVictor MerckléScore: 2,666Success
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 16:422,61629,799,58320,447,0001,010,00024,576stderr
2Sep 8, 2026 16:422,65130,821,25421,741,000024,576stderr
3Sep 8, 2026 16:422,65930,965,71621,804,000024,576stderr
4Sep 8, 2026 16:422,66530,084,19721,853,000024,576stderr
5Sep 8, 2026 16:422,66630,975,73521,862,000024,576stderr
6Sep 8, 2026 16:422,67031,152,64321,900,000024,576stderr
7Sep 8, 2026 16:422,67230,368,05921,917,000024,576stderr
8Sep 8, 2026 16:422,68131,150,46621,985,000024,576stderr
9Sep 8, 2026 16:425,95758,438,62947,837,0001,014,00024,576stderr