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 listOct 9, 2026 10:43Karthik ReddyKarthik ReddyScore: 2,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 11:042,53029,364,40220,748,000020,480
2Oct 9, 2026 11:042,53229,273,04320,766,000020,480
3Oct 9, 2026 11:042,53229,388,66520,763,000020,480
4Oct 9, 2026 11:042,53529,356,81620,790,000020,480
5Oct 9, 2026 11:042,53529,293,80420,794,000020,480
6Oct 9, 2026 11:042,53629,431,26420,798,000020,480
7Oct 9, 2026 11:042,53629,459,08720,802,000020,480
8Oct 9, 2026 11:042,53829,364,39320,817,000020,480
9Oct 9, 2026 11:042,53929,547,23220,824,000020,480