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 11, 2021 20:10Yuriy LyfenkoYuriy LyfenkoScore: 127,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 20:1383,420742,758,181684,047,61902,220,032
2Jun 11, 2021 20:13105,948937,697,726868,772,34202,293,760
3Jun 11, 2021 20:13109,872961,521,744900,952,52802,306,048
4Jun 11, 2021 20:10127,1261,117,153,0631,042,429,83702,301,952
5Jun 11, 2021 20:10130,3971,130,172,2901,069,256,15602,310,144
6Jun 11, 2021 20:10139,6921,199,342,9291,145,472,19102,297,856