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 listJan 6, 2026 10:25Rajarshi BasuRajarshi BasuScore: 81,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 10:254,87764,729,88833,991,0005,998,0002,379,776
2Jan 6, 2026 10:2581,901697,916,574541,666,000129,919,0002,301,952
3Jan 6, 2026 10:2593,643798,039,326646,890,000120,979,0002,310,144