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 listSep 3, 2021 16:28Ilya AniskovetsIlya AniskovetsScore: 97,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2021 16:2476,225690,886,386625,044,66802,281,472
2Sep 3, 2021 16:2476,939706,599,767630,895,89802,281,472
3Sep 3, 2021 16:2496,146861,141,160788,393,35102,301,952
4Sep 3, 2021 16:2897,140859,287,296796,548,72002,285,568
5Sep 3, 2021 16:28104,415921,715,286856,199,79302,293,760
6Sep 3, 2021 16:28112,331976,914,334921,116,56202,285,568