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 listJul 7, 2026 08:21Victor MerckléVictor MerckléScore: 3,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 08:253,09834,779,34524,253,0001,158,0002,138,112stderr
2Jul 7, 2026 08:253,09934,702,44524,292,0001,120,0002,134,016stderr
3Jul 7, 2026 08:253,10334,831,33724,286,0001,160,0002,134,016stderr
4Jul 7, 2026 08:253,13635,070,74123,586,0002,132,0002,179,072stderr
5Jul 7, 2026 08:253,13735,111,58524,585,0001,142,0002,134,016stderr
6Jul 7, 2026 08:253,25936,130,88725,545,0001,182,0002,179,072stderr
7Jul 7, 2026 08:2511,897106,964,97995,311,0002,247,0002,138,112stderr
8Jul 7, 2026 08:2511,978107,535,47295,898,0002,322,0002,134,016stderr
9Jul 7, 2026 08:2512,100108,592,06897,029,0002,194,0002,134,016stderr