compute count of trips and average trip distance for taxi rides in nyc

There is only one task and it should be a single file that you will write:

This task requires the use of the STL(vector, map, set,etc; whatever you deem appropriate), but not the use of classes or inheritance or polymorphism. The must run on Linux.

Task: Compute count of trips and average trip distance for taxi rides in NYC, per day of the week(Sun-Sat), per year, for all Yellow Taxi files on delenn in folder /bigdata/data/taxi

There are huge files so it will take time to run. There’s really no need to run you program on all the files, but it should work on any file with same format. The file format is CSV for each file, and the columns you care about are column 2 for the date, and column 5 for the trip distance

Your code must be moderately efficient, your program shouldn’t use more than 10MB of memory and should finish on all the 2019 files in about 30 minutes, or a single 2019 in about 3 minutes. Note, the files have some bad data( bad dates ), so you’ll see weird results.