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 16:46Victor MerckléVictor MerckléScore: 2,944Success
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 16:472,90432,218,02722,799,0001,017,0002,117,632stderr
2Jul 7, 2026 16:472,91531,891,70222,889,0001,015,0002,117,632stderr
3Jul 7, 2026 16:472,92131,986,43122,839,0001,116,0002,117,632stderr
4Jul 7, 2026 16:472,92931,962,87923,001,0001,023,0002,117,632stderr
5Jul 7, 2026 16:472,94432,146,10223,044,0001,104,0002,117,632stderr
6Jul 7, 2026 16:472,94732,265,49223,155,0001,014,0002,117,632stderr
7Jul 7, 2026 16:472,95132,648,54423,186,0001,017,0002,117,632stderr
8Jul 7, 2026 16:4711,675103,732,50094,683,0001,054,0002,117,632stderr
9Jul 7, 2026 16:4711,708104,037,47094,881,0001,126,0002,117,632stderr