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 listAug 30, 2021 12:15Vitaliy F.Vitaliy F.Score: 137,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2021 12:15130,3301,131,306,0271,068,707,60602,199,552
2Aug 30, 2021 12:15137,9731,209,393,9581,131,379,88702,207,744
3Aug 30, 2021 12:15147,5201,268,895,4101,209,659,93302,203,648