Daily Problem
ACM ICPC Team Today I finally was able to solve the challenge at Hackerrank: https://www.hackerrank.com/challenges/acm-icpc-team/problem?isFullScreen=true You have binary strings as input, then you need to OR them and see which ones have the most 1's. This took some time for me for some reason. I tried to solve it with BitSet but I was not able to parse large strings to integers (got numeric exception) In the end I just wanted to see if the brute force would be able to do the operations under given time constraints and it worked so I went with that.