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 listAug 3, 2022 02:29Yuriy LyfenkoYuriy LyfenkoScore: 6,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2022 02:296,236613,563,42051,137,83402,306,048
2Aug 3, 2022 02:296,286581,351,83637,396,00014,149,0002,412,544
3Aug 3, 2022 02:296,309576,964,94938,799,00012,933,0002,478,080
4Aug 3, 2022 02:296,320575,288,42242,851,0008,969,0002,461,696
5Aug 3, 2022 02:296,413582,088,75643,657,0008,929,0002,445,312
6Aug 3, 2022 02:296,439576,257,16342,838,0009,962,0002,281,472
7Aug 3, 2022 02:296,471582,190,94539,046,00014,016,0002,273,280
8Aug 3, 2022 02:296,592575,216,69142,040,00012,011,0002,428,928
9Aug 3, 2022 02:296,636617,547,43254,415,66502,248,704
10Aug 3, 2022 02:296,670580,014,39143,758,00010,939,0002,461,696
11Aug 3, 2022 02:296,847579,386,71143,113,00013,034,0002,428,928
12Aug 3, 2022 02:297,027631,875,70357,624,78502,240,512