I wrote a slightly more interesting program called IntersectSquares, which generates an array of a large number of rectangles, then counts how many times they intersect each other. This is written in a fairly naive way, so there are a fair few expression for the optimiser to move out of the loop. I tried it here with 100,000 rectangles:

With jkit:

andrew@rise:test cases$ time java IntersectSquares; time java IntersectSquares

3290 intersections

```
```real 0m58.843s

user 0m58.470s

sys 0m0.020s

3290 intersections

`real 0m58.918s`

user 0m58.491s

sys 0m0.040s

With javac:

andrew@rise:test cases$ time java IntersectSquares; time java IntersectSquares; time java IntersectSquares

3290 intersections

```
```real 1m4.690s

user 1m3.783s

sys 0m0.030s

3290 intersections

real 1m4.908s

user 1m3.805s

sys 0m0.051s

3290 intersections

`real 1m4.209s`

user 1m3.695s

sys 0m0.041s