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 13, 2021 15:50Yurkov AlekseyYurkov AlekseyScore: 114,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 15:5073,597663,303,258603,498,44002,297,856
2Jun 13, 2021 15:50114,3901,002,032,958937,998,87002,174,976
3Jun 13, 2021 15:50127,7401,120,934,6871,047,469,63502,293,760