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 listDec 27, 2025 12:05Rajarshi BasuRajarshi BasuScore: 22,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 12:0522,576218,531,660185,123,00002,519,040
2Dec 27, 2025 12:0522,863216,137,006186,473,0001,002,0002,383,872
3Dec 27, 2025 12:0523,642222,236,615192,868,000999,0002,510,848