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 12:19Victor MerckléVictor MerckléScore: 5,407Success
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 12:202,71630,726,68221,206,0001,066,0002,117,632stderr
2Sep 1, 2026 12:202,72730,765,37321,303,0001,066,0002,117,632stderr
3Sep 1, 2026 12:202,72730,877,47321,252,0001,110,0002,117,632stderr
4Sep 1, 2026 12:205,40052,648,24443,271,0001,016,0002,117,632stderr
5Sep 1, 2026 12:205,40752,600,55443,324,0001,014,0002,117,632stderr
6Sep 1, 2026 12:205,41053,356,91743,352,0001,016,0002,117,632stderr
7Sep 1, 2026 12:205,41053,366,55543,350,0001,015,0002,117,632stderr
8Sep 1, 2026 12:205,41852,944,82243,414,0001,016,0002,117,632stderr
9Sep 1, 2026 12:205,44853,779,88043,639,0001,037,0002,117,632stderr