{"push_id":1448126213,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"da10f14f19f96c99436b824e8e9c054573bec30a","before":"739691e83a93ac8cb5b3c34faa25cd44c82bbfc8","commits":[{"sha":"da10f14f19f96c99436b824e8e9c054573bec30a","author":{"name":"Tedd Terry","email":"ebed120215b496e5b4d523897464da74f87fe2db@izotope.com"},"message":"Day 9.  There's probably a faster way to make the recursive calculation.","distinct":true,"url":"https://api.github.com/repos/eightyeighteyes/adventofcode-py/commits/da10f14f19f96c99436b824e8e9c054573bec30a"}]}
{"actor":{"display_login":"eightyeighteyes"}}