{"push_id":549208362,"size":1,"distinct_size":1,"ref":"refs/heads/Problem-3","head":"6ad00aedd63c1f2785d9f8049426942e7e2a2102","before":"0274327f0e9f9a4b80f08ebcbab2690ba41ce722","commits":[{"sha":"6ad00aedd63c1f2785d9f8049426942e7e2a2102","author":{"email":"624a451458ba57a26289487c90def5ff8e9345d8@yahoo.co.uk","name":"A-Manning"},"message":"Problem 3 Solution in Java\n\nHighly inefficient. Runtime to compute the largest prime factor of\n600851475143  was over 10 minutes. Hopefully F# will improve my runtime.","distinct":true,"url":"https://api.github.com/repos/A-Manning/ProjectEuler/commits/6ad00aedd63c1f2785d9f8049426942e7e2a2102"}]}