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 23:00Yuriy LyfenkoYuriy LyfenkoScore: 46,402Success
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 23:0144,072433,417,434361,387,11302,301,952
2Jun 12, 2021 23:0145,640430,141,734374,251,27102,310,144
3Jun 12, 2021 23:0145,918437,068,189376,528,50402,297,856
4Jun 12, 2021 23:0046,402455,891,885380,500,36102,228,224
5Jun 12, 2021 23:0046,419448,057,125380,632,95802,269,184
6Jun 12, 2021 23:0046,525441,360,488381,502,32702,265,088