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 23:13emily graceemily graceScore: 117,999Success
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 23:1392,021816,936,615754,574,22002,301,952
2Mar 27, 2024 23:13117,9991,053,782,203967,589,54502,297,856
3Mar 27, 2024 23:13146,7721,268,051,3121,203,532,16702,195,456