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 13, 2021 05:28Yuriy LyfenkoYuriy LyfenkoScore: 8,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 05:288,550137,255,26170,111,87402,236,416
2Jun 13, 2021 05:288,639127,627,90970,837,94302,232,320
3Jun 13, 2021 05:288,726106,866,15954,424,00017,133,0002,424,832
4Jun 13, 2021 05:288,730102,913,63052,430,00019,157,0002,506,752
5Jun 13, 2021 05:288,753102,082,38553,833,00017,944,0002,351,104
6Jun 13, 2021 05:288,755101,080,31952,845,00018,944,0002,277,376
7Jun 13, 2021 05:288,785101,533,34758,027,00014,006,0002,490,368
8Jun 13, 2021 05:288,804124,174,25172,195,68602,232,320
9Jun 13, 2021 05:288,888105,098,44353,910,00018,968,0002,465,792
10Jun 13, 2021 05:288,916107,002,13855,082,00018,027,0002,502,656
11Jun 13, 2021 05:288,918100,732,45753,092,00020,034,0002,486,272
12Jun 13, 2021 05:288,95299,888,33354,303,00019,106,0002,502,656