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:32Victor MerckléVictor MerckléScore: 5,440Success
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:332,73930,903,44421,371,0001,094,0002,117,632stderr
2Sep 1, 2026 05:332,77731,766,64721,742,0001,031,0002,117,632stderr
3Sep 1, 2026 05:332,79731,245,53221,922,0001,017,0002,117,632stderr
4Sep 1, 2026 05:335,39352,588,29643,181,0001,047,0002,117,632stderr
5Sep 1, 2026 05:335,44052,965,84043,558,0001,050,0002,117,632stderr
6Sep 1, 2026 05:335,45553,108,33543,661,0001,073,0002,117,632stderr
7Sep 1, 2026 05:335,45653,759,48943,603,0001,142,0002,117,632stderr
8Sep 1, 2026 05:335,46053,114,64643,634,0001,146,0002,117,632stderr
9Sep 1, 2026 05:335,46153,115,77643,657,0001,127,0002,117,632stderr