An hour of optimization later, and my algorithm for merging gappy sequences is *much* faster - for a testing set of 200k values (split up into a few separate slices and then re-merged into one), it went from several minutes runtime and 90MB heap use, to under 200ms runtime and 9MB heap use!

(This is for my Matrix client, for merging server responses into the local message cache)