Suppose I have n csv files each containing a chronologically ordered sequence of events and the timestamps at which they occurred. E.g., one file might look like:

1614105896,A
1614105898,B
1614105900,C
1614105902,C

where A, B and C represent events.

Given that the timespans of the files may overlap, what’s an efficient way to process the events in these n files chronologically? Also bear in mind it might take a long time to process each event.

Source: Windows Questions C++