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 08:53Yurkov AlekseyYurkov AlekseyScore: 1,343,554Success
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 08:531,340,19311,039,382,59210,989,585,07602,174,976
2Jun 13, 2021 08:531,343,55411,076,225,35411,017,140,49802,179,072
3Jun 13, 2021 08:531,348,12311,135,389,97211,054,606,92802,301,952