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 listFeb 21, 2024 09:35Huy Duc LeHuy Duc LeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 09:3500000Error: No answer to stdout. Died or killed?stderr
2Feb 21, 2024 09:367,556119,361,15361,955,16902,240,512
3Feb 21, 2024 09:367,774124,140,98563,750,15102,183,168
4Feb 21, 2024 09:368,262132,359,91567,746,31702,273,280