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 05:46Victor MerckléVictor MerckléScore: 2,949Success
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 05:472,90232,173,58722,730,0001,073,0002,117,632stderr
2Sep 1, 2026 05:472,91832,267,61522,848,0001,081,0002,117,632stderr
3Sep 1, 2026 05:472,92832,454,42222,816,0001,197,0002,117,632stderr
4Sep 1, 2026 05:472,94032,492,45822,925,0001,191,0002,117,632stderr
5Sep 1, 2026 05:472,94933,219,47623,021,0001,168,0002,117,632stderr
6Sep 1, 2026 05:475,57454,141,16044,692,0001,016,0002,117,632stderr
7Sep 1, 2026 05:475,58854,282,71844,805,0001,017,0002,117,632stderr
8Sep 1, 2026 05:475,60454,299,16844,935,0001,020,0002,117,632stderr
9Sep 1, 2026 05:475,62354,459,08045,093,0001,018,0002,117,632stderr