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 listOct 13, 2022 20:24Yuriy LyfenkoYuriy LyfenkoScore: 6,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2022 20:246,159577,679,97241,416,0009,091,0002,379,776
2Oct 13, 2022 20:246,254581,013,80642,235,0009,050,0002,371,584
3Oct 13, 2022 20:246,311580,178,73142,796,0008,957,0002,355,200
4Oct 13, 2022 20:246,311579,779,53338,815,00012,938,0002,310,144
5Oct 13, 2022 20:246,363576,692,08744,152,0008,027,0002,428,928
6Oct 13, 2022 20:246,441577,167,43141,853,00010,961,0002,326,528
7Oct 13, 2022 20:246,453622,319,76252,910,56002,314,240
8Oct 13, 2022 20:246,533614,084,36953,572,63902,260,992
9Oct 13, 2022 20:246,579581,996,99243,957,0009,990,0002,527,232
10Oct 13, 2022 20:246,750582,608,16941,259,00014,088,0002,265,088
11Oct 13, 2022 20:246,809583,651,90038,883,00016,949,0002,457,600
12Oct 13, 2022 20:246,873628,359,92856,356,65602,232,320