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 14:46Victor MerckléVictor MerckléScore: 2,624Success
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 14:472,61629,950,33120,421,0001,033,0002,117,632stderr
2Sep 1, 2026 14:472,61630,504,52520,306,0001,147,0002,117,632stderr
3Sep 1, 2026 14:472,62229,857,38420,488,0001,018,0002,117,632stderr
4Sep 1, 2026 14:472,62329,868,92620,475,0001,034,0002,121,728stderr
5Sep 1, 2026 14:472,62431,928,40220,486,0001,035,0002,117,632stderr
6Sep 1, 2026 14:472,62729,858,20420,527,0001,022,0002,117,632stderr
7Sep 1, 2026 14:472,63429,943,51920,573,0001,030,0002,117,632stderr
8Sep 1, 2026 14:472,63730,639,09120,606,0001,018,0002,117,632stderr
9Sep 1, 2026 14:475,27851,614,10942,010,0001,270,0002,117,632stderr