Sum even Fibonacci numbers not exceeding 4 million (Project Euler Problem #2)

SumEvenFibo_lt_4M.java

/*
   Minimalistic (length-wise) looping Java code for Project Euler problem #2 (https://projecteuler.net/problem=2).
   Finds the sum of /even/ Fibonacci numbers which do not exceed 4 million.
   ^= operater use for variable swap in Java cannot be as compact as in C, see:
     http://stackoverflow.com/questions/3844934/why-is-this-statement-not-working-in-java-x-y-x-y

   @author Taimo Peelo
*/
public class SumEvenFibo_lt_4M {
    public static void main(String[] args) { // Output is 4613732
        for (long s = 0, f[] = {0, 1}; f[1] <= 4_000_000L || System.out.printf("%d%n", s).checkError(); f[0] ^= f[1]^(f[1]=f[0]), s += (f[1] += f[0]) % 2 == 0 ? f[1] : 0);
    }
}