larsivi

I don't normally bother (or have time for) the various programming competitions on the net. This one caught my eye however, as I find the Tango implementation fairly short and elegant (the one that prompted my attention was in F# and wasn't particularly readable IMO, but then I'm not really into functional programming).

The task (see here to get your instance) is to process a directory tree (provided from Google in a zip file), and sum up values on certain lines of certain files.

My instance told me to sum values on line 5 in files with extension ".js" and with "BCD" somewhere in the path and multiply that with the sum of the values on line 1 in files with extension ".txt" and with "zzz" somewhere in the path. Empty lines should not be counted (I probably misunderstood something as an empty line would only have yielded a zero value for the sum in any case, but I got the correct result according to Google).