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 11:28Yurkov AlekseyYurkov AlekseyScore: 103,726Success
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 11:2886,189786,257,795706,752,26602,297,856
2Jun 13, 2021 11:3396,447851,181,363790,862,43002,301,952
3Jun 13, 2021 11:33102,361904,602,119839,362,57202,289,664
4Jun 13, 2021 11:33103,726914,015,338850,553,98602,285,568
5Jun 13, 2021 11:28110,972968,591,048909,968,20802,297,856
6Jun 13, 2021 11:28120,7721,055,834,822990,326,89002,297,856