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, 2021 13:34Yuriy LyfenkoYuriy LyfenkoScore: 94,042Success
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, 2021 13:3492,801815,325,841760,967,56702,297,856
2Jun 12, 2021 13:3494,042836,668,116771,145,77602,301,952
3Jun 12, 2021 13:3498,978867,467,688811,622,06802,306,048