Find the sum of all the multiples of 3 or 5 below 1000.
Since this is a simple problem, let's try to find the SMALLEST piece of code that can do this task. However, I will not count spaces in the code at all because we don't want to make it too cryptic.
For scoring, I will use the Character.isWhitespace() method. If it returns false, the character count increases. Let's see how small you can get it with standard Java. (Standard libraries imports are counted, but not the contents of those classes). You may not use any non-standard Java library. Good luck.
By the way, the correct answer for this application is 233168.