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 10:46Victor MerckléVictor MerckléScore: 2,750Success
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 10:472,72330,778,48721,193,0001,140,0002,117,632stderr
2Sep 1, 2026 10:472,73030,783,68121,329,0001,062,0002,117,632stderr
3Sep 1, 2026 10:472,73831,373,03821,385,0001,073,0002,117,632stderr
4Sep 1, 2026 10:472,74530,637,68421,479,0001,032,0002,117,632stderr
5Sep 1, 2026 10:472,75030,935,68121,372,0001,182,0002,117,632stderr
6Sep 1, 2026 10:475,38152,306,59043,117,0001,015,0002,117,632stderr
7Sep 1, 2026 10:475,38652,324,80843,161,0001,012,0002,117,632stderr
8Sep 1, 2026 10:475,40752,657,80543,324,0001,017,0002,117,632stderr
9Sep 1, 2026 10:475,43553,660,89643,560,0001,013,0002,117,632stderr