{"push_id":637250119,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7ee6bd269e1a22798385bdf293588a892ef3334f","before":"c184816232b5ea891ee9464240628e6f98aafb55","commits":[{"sha":"7ee6bd269e1a22798385bdf293588a892ef3334f","author":{"email":"62953b3995465956c1abbbda855fc8098b4bd36c@hotmail.com","name":"danys"},"message":"Efficient O(B*log N) binary search solution","distinct":true,"url":"https://api.github.com/repos/danys/google-code-jam/commits/7ee6bd269e1a22798385bdf293588a892ef3334f"}]}