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:45Yurkov AlekseyYurkov AlekseyScore: 92,950Success
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:4576,881692,745,797630,425,92902,297,856
2Jun 13, 2021 15:4592,950821,056,378762,186,32102,285,568
3Jun 13, 2021 15:4594,149834,463,916772,024,23902,297,856