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 listMar 27, 2024 20:35emily graceemily graceScore: 138,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 20:35106,039945,270,835869,520,46002,199,552
2Mar 27, 2024 20:35138,1891,201,906,8371,133,147,08902,306,048
3Mar 27, 2024 20:35288,6222,432,302,2802,366,700,09102,301,952