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 09:37Vitaliy F.Vitaliy F.Score: 1,480,551Success
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 09:371,478,31412,224,743,55912,122,176,94902,252,800
2Jul 4, 2021 09:371,480,55112,208,727,59512,140,514,60502,260,992
3Jul 4, 2021 09:371,489,67312,277,594,02012,215,315,57802,260,992