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 7, 2026 17:03Victor MerckléVictor MerckléScore: 2,594Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:042,58630,373,88821,206,000024,576stderr
2Sep 7, 2026 17:042,59029,498,54621,245,000024,576stderr
3Sep 7, 2026 17:042,59330,342,57821,264,000024,576stderr
4Sep 7, 2026 17:042,59330,422,68021,265,000024,576stderr
5Sep 7, 2026 17:042,59429,468,45821,277,000024,576stderr
6Sep 7, 2026 17:042,59930,478,61520,288,0001,029,00024,576stderr
7Sep 7, 2026 17:042,59929,555,48621,314,000024,576stderr
8Sep 7, 2026 17:042,60229,555,31321,342,000024,576stderr
9Sep 7, 2026 17:045,27251,490,17442,055,0001,179,00024,576stderr