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 listJul 4, 2021 01:42Egor SergeevEgor SergeevScore: 125,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2021 01:42125,5051,089,910,7811,029,142,69502,301,952
2Jul 4, 2021 01:42125,8581,086,325,5121,032,035,38502,310,144
3Jul 4, 2021 01:42126,0841,098,247,0891,033,892,33202,301,952