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 listSep 2, 2021 14:51piculpiculError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2021 14:4900000Error: expected "2281111496 ", got "-2013855800 "
2Sep 2, 2021 14:5188,893806,621,919728,924,71202,297,856
3Sep 2, 2021 14:5191,368810,308,270749,220,94802,297,856
4Sep 2, 2021 14:51120,0651,057,209,087984,532,87602,293,760