If Tie::Array::Sorted is available, use it to insert input in order instead
of recalculating on every interval. Assumes frequent refreshes of thousands
of lines, in which case it saves significantly, also slowing down less
exponentially (probably O(l) instead of O(t*l²)).