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:59Victor MerckléVictor MerckléScore: 2,819Success
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 06:002,79831,414,59321,895,0001,051,0002,117,632stderr
2Sep 1, 2026 06:002,80731,465,22221,969,0001,052,0002,117,632stderr
3Sep 1, 2026 06:002,81031,197,12221,988,0001,055,0002,117,632stderr
4Sep 1, 2026 06:002,81231,514,34722,016,0001,045,0002,117,632stderr
5Sep 1, 2026 06:002,81931,522,21422,051,0001,069,0002,117,632stderr
6Sep 1, 2026 06:002,82331,409,59222,085,0001,066,0002,117,632stderr
7Sep 1, 2026 06:005,45153,757,76443,675,0001,024,0002,117,632stderr
8Sep 1, 2026 06:005,46753,175,20643,803,0001,028,0002,117,632stderr
9Sep 1, 2026 06:005,50153,347,74943,102,0002,012,0002,117,632stderr