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 11, 2021 19:25Yuriy LyfenkoYuriy LyfenkoScore: 129,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 19:25106,354933,009,073872,105,24502,174,976
2Jun 11, 2021 19:25129,8171,125,268,0721,064,499,21702,293,760
3Jun 11, 2021 19:25158,4871,359,361,4711,299,590,19102,174,976