{"push_id":1036592406,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"c4ee9afad2150dd346e7ef1dedef8a91ff873381","before":"d71e3a0d54283622d6c63ec2a13fc6a889ca7c61","commits":[{"sha":"1d9a0961271d6ec66ceb2e04c899752b7ebc4c9c","author":{"email":"d8af864a6aad651c78ad6cceb8899c7ef11455ef@gmail.com","name":"Kevin Tai"},"message":"Painfully slow solution for 10, b/c slow way to find primes","distinct":true,"url":"https://api.github.com/repos/kevinrtai/haskell-euler/commits/1d9a0961271d6ec66ceb2e04c899752b7ebc4c9c"},{"sha":"c4ee9afad2150dd346e7ef1dedef8a91ff873381","author":{"email":"d8af864a6aad651c78ad6cceb8899c7ef11455ef@gmail.com","name":"Kevin Tai"},"message":"Simplified expression for product","distinct":true,"url":"https://api.github.com/repos/kevinrtai/haskell-euler/commits/c4ee9afad2150dd346e7ef1dedef8a91ff873381"}]}