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 listJun 28, 2026 06:27Victor MerckléVictor MerckléScore: 11,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 06:283,04832,894,41623,788,0001,208,0002,117,632stderr
2Jun 28, 2026 06:283,05332,923,95023,841,0001,195,0002,117,632stderr
3Jun 28, 2026 06:283,06532,990,51023,906,0001,229,0002,117,632stderr
4Jun 28, 2026 06:283,09833,255,60624,218,0001,187,0002,117,632stderr
5Jun 28, 2026 06:2811,985106,129,33797,274,0001,009,0002,117,632stderr
6Jun 28, 2026 06:2811,994106,209,79397,347,0001,009,0002,117,632stderr
7Jun 28, 2026 06:2812,039106,543,76397,711,0001,009,0002,117,632stderr
8Jun 28, 2026 06:2812,072106,881,61197,988,0001,009,0002,117,632stderr
9Jun 28, 2026 06:2812,086111,202,22298,098,0001,009,0002,117,632stderr