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 18:16Yurkov AlekseyYurkov AlekseyScore: 40,518Success
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 18:1736,539362,524,029299,620,01702,293,760
2Jun 13, 2021 18:1738,943377,807,962319,332,92102,297,856
3Jun 13, 2021 18:1739,479395,402,325323,724,55702,293,760
4Jun 13, 2021 18:1739,886382,179,840327,064,37902,297,856
5Jun 13, 2021 18:1640,518388,063,999332,250,28902,293,760
6Jun 13, 2021 18:1742,979431,778,544352,426,78002,174,976
7Jun 13, 2021 18:1645,509433,274,666373,175,64102,301,952
8Jun 13, 2021 18:1645,657444,164,217374,389,20402,306,048
9Jun 13, 2021 18:1751,581496,649,899422,964,14102,293,760