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 03:35Yuriy LyfenkoYuriy LyfenkoScore: 47,109Success
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 03:3547,056451,947,550385,859,17902,224,128
2Jun 13, 2021 03:3547,109451,583,370386,293,17702,228,224
3Jun 13, 2021 03:3549,844465,935,503408,724,85002,236,416