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 listJun 12, 2024 18:54Nicholas PatrickNicholas PatrickScore: 50,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2024 18:5450,861476,367,477417,059,64702,183,168
2Jun 12, 2024 18:5450,996488,958,873418,167,51002,293,760
3Jun 12, 2024 18:5451,981479,830,822426,241,65502,301,952