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:51Yurkov AlekseyYurkov AlekseyScore: 102,569Success
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:5194,029825,436,187771,039,33002,297,856
2Jun 13, 2021 11:51102,569898,980,514841,066,97502,293,760
3Jun 13, 2021 11:51114,7061,007,226,290940,585,78502,297,856