A company currently pays a fixed sum for the use of a particular licensed software package.   In determining if it has a good deal it decides to calculate its maximum use of the software from its license management log file.

Assume the software's licensing daemon faithfully records a checkout event when a copy of the software starts and a checkin event when the software finishes to its log file.

An example of checkout and checkin events are:

 License OUT @ 2008/10/03_23:51:05 for job 4974
 ...
 License IN  @ 2008/10/04_00:18:22 for job 4974



Task

Save the 10,000 line log file from    here   into a local file, then write a program to scan the file extracting both the maximum licenses that were out at any time, and the time(s) at which this occurs.

Mirror of log file available as a zip here (offsite mirror).




import util.
 
go =>
  Jobs = read_file_lines("mlijobs.txt"),
  Counts = asum(Jobs).to_array, % convert to array for speed
  Max = max(Counts),
  MaxIxs = [I : I in 1..Counts.length, Counts[I] == Max],
  printf("Max number of licenses is %d.\n", Max),
  printf("Interval:\n%w\n", [Jobs[J,15..33] : J in MaxIxs].join("\n")),
  nl.
 
% Accumulative sum
asum(List) = Asum =>
  asum(List,[],Asum).
asum([],Asum0,Asum) => 
  Asum = Asum0.reverse().
asum([H|T],[],Asum) => 
  C = cond(slice(H,9,11) == "OUT", 1, -1),
  asum(T,[C],Asum).
asum([H|T],Asum0,Asum) =>
  Asum0 = [Last|_],
  C = cond(slice(H,9,11) == "OUT", 1, -1),
  asum(T,[Last+C|Asum0],Asum).