Keystroke array should be a more descriptive data structure

[aczid]

Currently keystrokes are stored in an array, and are treated as single characters.
To improve the accuracy of the algorithm it would be better to store calculate seek time of the current character relative to the last character.
I’m not sure what would be a good data structure for this. Maybe it should be a tree?