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 listJul 8, 2026 12:15Victor MerckléVictor MerckléScore: 2,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 12:162,87931,624,03922,592,0001,016,0002,117,632stderr
2Jul 8, 2026 12:162,88031,681,59822,578,0001,040,0002,117,632stderr
3Jul 8, 2026 12:162,88332,146,44122,614,0001,032,0002,117,632stderr
4Jul 8, 2026 12:162,89631,811,95722,622,0001,126,0002,117,632stderr
5Jul 8, 2026 12:162,90531,940,66922,809,0001,015,0002,117,632stderr
6Jul 8, 2026 12:162,91832,242,29922,913,0001,015,0002,117,632stderr
7Jul 8, 2026 12:1611,633103,379,05194,346,0001,050,0002,117,632stderr
8Jul 8, 2026 12:1611,722104,176,79695,076,0001,046,0002,117,632stderr
9Jul 8, 2026 12:1611,772104,614,71295,359,0001,177,0002,117,632stderr