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:17Yuriy LyfenkoYuriy LyfenkoScore: 122,947Success
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:18107,397943,850,282880,652,87302,293,760
2Jun 11, 2021 20:17112,645986,643,934923,685,55102,310,144
3Jun 11, 2021 20:18113,511992,579,603930,789,10002,297,856
4Jun 11, 2021 20:17122,9471,069,920,9311,008,161,30202,306,048
5Jun 11, 2021 20:17124,6981,105,710,9131,022,527,65402,310,144
6Jun 11, 2021 20:18129,7641,122,661,3381,064,066,91402,301,952