Not that it matters, but this was the code I submitted (as a solution to check-if-pallindrome) :

String s1=Integer.toString(x);
        for(int i=0;i<s1.length()/2;i++){
            if(s1.charAt(i)!=s1.charAt(s1.length()-1-i)){
                return false;
            }
        }
        return true;

and beat

7.74% of the solutions - the first time i ran it
25.31% the second time (no modifications)
3.95% the third time

Why?