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 29, 2021 15:48alex3dalex3dScore: 177,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 29, 2021 15:42158,1921,364,616,0331,297,171,53702,281,472
2Jun 29, 2021 15:48165,6841,424,008,6761,358,610,57502,301,952
3Jun 29, 2021 15:42172,8691,475,653,7151,417,527,63102,281,472
4Jun 29, 2021 15:48177,6041,525,598,4831,456,352,38802,277,376
5Jun 29, 2021 15:42182,0581,566,916,0401,492,875,86902,293,760
6Jun 29, 2021 15:48189,9071,614,501,4351,557,236,04602,285,568