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 00:42Egor SergeevEgor SergeevScore: 87,780Success
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 00:4282,914752,683,395679,898,57802,285,568
2Jul 4, 2021 00:4287,780785,178,396719,792,21202,293,760
3Jul 4, 2021 00:4298,059871,271,070804,082,31002,277,376