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:33Yurkov AlekseyYurkov AlekseyScore: 90,640Success
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:3383,062736,224,479681,110,71102,297,856
2Jun 13, 2021 11:2786,695773,814,067710,896,31402,301,952
3Jun 13, 2021 11:2787,968784,701,730721,335,08402,293,760
4Jun 13, 2021 11:2790,640813,960,988743,246,79502,293,760
5Jun 13, 2021 11:3396,021854,441,222787,371,37002,297,856
6Jun 13, 2021 11:3398,393887,076,512806,820,62302,293,760