[algogeeks] Efficient data structure to store sorted timestamped data

[Jay]

I have to read a large file where every line is timestamped and the
file is sorted by timestamp. I need to store all that data in some good
data structure so that later on I can easily do calculations on data
between two timestamps meaning I will have to search based on date-time
later.
    If I use hashtable to store as I read each line from file,  search
may be good later but I am not making any use of the fact that the data
is sorted.