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 3, 2026 01:44Karthik ReddyKarthik ReddyScore: 2,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:452,48731,020,89720,400,000020,480
2Oct 3, 2026 01:452,49329,543,95720,450,000020,480
3Oct 3, 2026 01:452,49429,541,67520,453,000020,480
4Oct 3, 2026 01:452,49429,584,88220,453,000020,480
5Oct 3, 2026 01:452,49529,499,98420,463,000020,480
6Oct 3, 2026 01:452,49629,504,56420,468,000020,480
7Oct 3, 2026 01:452,49829,436,23820,486,000020,480
8Oct 3, 2026 01:452,49830,825,77620,484,000020,480
9Oct 3, 2026 01:452,50129,508,99120,511,000020,480