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 1, 2026 11:32Victor MerckléVictor MerckléScore: 2,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 11:332,70130,609,15621,033,0001,117,0002,117,632stderr
2Sep 1, 2026 11:332,71630,447,47821,251,0001,025,0002,117,632stderr
3Sep 1, 2026 11:332,71730,610,47821,161,0001,126,0002,117,632stderr
4Sep 1, 2026 11:332,71931,517,39721,200,0001,101,0002,117,632stderr
5Sep 1, 2026 11:332,72430,655,51021,212,0001,132,0002,117,632stderr
6Sep 1, 2026 11:332,72430,675,12021,266,0001,071,0002,117,632stderr
7Sep 1, 2026 11:332,74530,729,81221,388,0001,121,0002,117,632stderr
8Sep 1, 2026 11:335,42052,680,19643,421,0001,026,0002,117,632stderr
9Sep 1, 2026 11:3310,37093,610,76982,883,0002,153,0002,117,632stderr