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 9, 2025 09:24Ian MckibbenIan MckibbenError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 09:2400000Error: expected "2251012685 ", got "0"
2Jan 9, 2025 09:2500000Error: No answer to stdout. Died or killed?
3Jan 9, 2025 09:2800000Error: expected "2210292614 ", got "0"
4Jan 9, 2025 09:2800000Error: No answer to stdout. Died or killed?
5Jan 9, 2025 09:2900000Error: No answer to stdout. Died or killed?
6Jan 9, 2025 09:2900000Error: No answer to stdout. Died or killed?
7Jan 9, 2025 09:3000000Error: expected "2224020273 ", got "0"
8Jan 9, 2025 09:3100000Error: No answer to stdout. Died or killed?
9Jan 9, 2025 09:3200000Error: expected "2210325476 ", got "0"