{"push_id":3139315129,"size":2,"distinct_size":1,"ref":"refs/heads/master","head":"bb1322749b366db954e72b46b429b74127ec6e5d","before":"e5f5cc4afdfc6e4366734e68f1cf368d8e642ecb","commits":[{"sha":"4b634ce6b133b76383cb08415267536a3ad7271e","author":{"name":"Tamas Benkoe","email":"83b69173de745fb4a2fe0227ae9489600e0c1a1e@1und1.de"},"message":"Solve problem 2 of day 9\n\nUsing a circular doubly linked list.","distinct":false,"url":"https://api.github.com/repos/bentomi/advent-of-code-2018/commits/4b634ce6b133b76383cb08415267536a3ad7271e"},{"sha":"bb1322749b366db954e72b46b429b74127ec6e5d","author":{"name":"bentomi","email":"0e783ec0acbca6e4a2d660aae5c3476d08916064@gmail.com"},"message":"Merge pull request #1 from bentomi/linked-list\n\nSolve problem 2 of day 9","distinct":true,"url":"https://api.github.com/repos/bentomi/advent-of-code-2018/commits/bb1322749b366db954e72b46b429b74127ec6e5d"}]}
{"actor":{"display_login":"bentomi"}}