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 listJun 12, 2021 22:18Yuriy LyfenkoYuriy LyfenkoScore: 62,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 22:1759,779552,397,393490,184,21902,224,128
2Jun 12, 2021 22:1760,426574,110,834495,489,29102,289,664
3Jun 12, 2021 22:1861,992572,925,131508,335,43302,211,840
4Jun 12, 2021 22:1862,604581,107,478513,350,01202,277,376
5Jun 12, 2021 22:1763,932593,623,563524,239,96602,285,568
6Jun 12, 2021 22:1866,090595,881,126541,940,77602,289,664