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 12, 2021 21:21Yuriy LyfenkoYuriy LyfenkoScore: 124,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 21:21117,4741,010,692,704963,284,78802,224,128
2Jun 12, 2021 21:21124,9211,078,875,2581,024,352,25602,228,224
3Jun 12, 2021 21:21146,3111,253,787,7491,199,749,26402,224,128