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 2, 2026 08:04Rajarshi BasuRajarshi BasuScore: 86,147Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 08:045,15269,449,35437,221,0005,029,0002,478,080
2Jan 2, 2026 08:0486,147738,265,040577,514,000128,891,0002,281,472
3Jan 2, 2026 08:04102,400865,945,527717,727,000121,953,0002,478,080