Speed up Nim again by making it simpler
Remove some alignment
Added Crystal version
NIM -> Nim
Reorder in Nim
Nimrod -> Nim
Minor refactor to Go version to make it shorter.

Use time.Since, which is shorthand for of time.Now().Sub.
Racket: fix indentation
Racket: rewrite `get-longest-path` loop using `for/fold` instead of `foldr`
minor change should result in decent speed up

max is also a function in F#
added julia.jl
Lift free variables out of `loop`
Use same data representation as Java version
More lisp speed boost

* construct list of node data in READ-PLACES without junk
* replace DEFPARAMETER calls with LET*
* use LABELS to have recursion within GET-LONGEST-PATH
Initial Perl version
Inital Perl version
Merge branch 'add-perl' of https://github.com/MasterDuke17/LPATHBench into add-perl
Faster java impl

Started with changes in reddit comments, improved further, also cleaned up readPlaces().
Update jv.java

Pass in row data as parameter, shaves another 30 ms or so.
Use -march=native for Nim as well