n = 100_000
K = 2 # seconds
time_secs = K * n * log(n)
t = timedelta(seconds=time_secs)
t # datetime.timedelta(days=26, seconds=56185, microseconds=92994)
So around a month (at 24×7, so in reality more like 3 months) of time sorting if in a horrendous abuse of big O notation we assume that sorting the notes takes 2 * n * log(n) seconds.I guess he could use a pigeonhole sort though - at constant factor of 10 seconds this gives 11 days 49600 seconds.