{"push_id":1402528307,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"106bc9243fb50e63ea4d1f758df7275f75f1750b","before":"b36b041d8f65cdaf19301c8697173f4fdbb20d9e","commits":[{"sha":"106bc9243fb50e63ea4d1f758df7275f75f1750b","author":{"name":"David Colborne","email":"d8099b0f90e53c29d29eb12a7a3caa5af4f12681@colbornemmx.com"},"message":"Create Problem7.cmd\n\nSolution for Project Euler's Problem 7:\r\nhttps://projecteuler.net/problem=7\r\n\r\nNote that, since CMD has an 8192 character limit for each variable, the list of previously discovered primes had to be broken down into a series of smaller variables.","distinct":true,"url":"https://api.github.com/repos/Oatworm/ProjectEuler.cmd/commits/106bc9243fb50e63ea4d1f758df7275f75f1750b"}]}
{"actor":{"display_login":"Oatworm"}}