The main idea behind the algorithm:
Create objects from every file, every object contain the index of the current comparing line, time-stamp of the the line and path to the file.
Create min heape base on time-stamp value and insert all the log-file objects.
Then pop the min and insert it to a new file.
After popping a line to the new file, get the next line of the file object and heapify the object to the right place base on the new time-stamp value.

Pull repo to your machine.
Open command line and navigate to the repo directory.
Write in the command line: python main.py -d [path-to-log-files]
If the path containing white spaces encapsulate the path by quotation marks.