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 8, 2026 05:49Victor MerckléVictor MerckléScore: 4,078Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 05:503,75340,885,37528,710,0002,071,0002,117,632stderr
2Sep 8, 2026 05:503,95242,387,68931,382,0001,032,0002,117,632stderr
3Sep 8, 2026 05:503,99242,728,68231,706,0001,030,0002,117,632stderr
4Sep 8, 2026 05:504,02343,051,62030,850,0002,141,0002,117,632stderr
5Sep 8, 2026 05:504,07843,443,21131,410,0002,030,0002,117,632stderr
6Sep 8, 2026 05:504,10943,659,43331,641,0002,055,0002,117,632stderr
7Sep 8, 2026 05:5011,477104,177,59090,991,0003,126,0002,117,632stderr
8Sep 8, 2026 05:5011,591104,998,85792,944,0002,105,0002,117,632stderr
9Sep 8, 2026 05:5011,798106,690,66594,641,0002,110,0002,117,632stderr