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:53Victor MerckléVictor MerckléScore: 2,605Success
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:542,59430,449,83121,275,000024,576stderr
2Sep 7, 2026 17:542,59429,528,64821,278,000024,576stderr
3Sep 7, 2026 17:542,59929,556,60621,318,000024,576stderr
4Sep 7, 2026 17:542,60129,721,17921,329,000024,576stderr
5Sep 7, 2026 17:542,60530,550,85021,367,000024,576stderr
6Sep 7, 2026 17:542,60630,499,11921,375,000024,576stderr
7Sep 7, 2026 17:542,60630,520,20421,376,000024,576stderr
8Sep 7, 2026 17:542,61129,689,67321,415,000024,576stderr
9Sep 7, 2026 17:542,61229,948,18220,416,0001,009,00024,576stderr