Teamwork challenge for Timus Online Judge
Ow, my eyes.  Your variable names all look so long and similar.  I can't even see all of the code at once without line wrapping.  I'd rather read for (int i = 0; i &lt; n; i++) than


for (int integersToBeProcessedCounter = 0; integersToBeProcessedCounter &lt; countOfIntegersToBeProcessed; integersToBeProcessedCounter++) {



In cases like this, short variable names are fine, because it is an established convention that i is an array index, and n is the array size.

Furthermore, the verbose naming isn't really that accurate anyway.  integerBeingProcessed isn't really an integer, but a string.

A further improvement in naming would come from breaking out the array analysis into a separate function, so that main() is just responsible for parsing the input.  Then, integersAsStringArray and countOfIntegersToBeProcessed can become seq and seq.length, respectively.

Just applying some renaming and other minor transformations…

public class TestClass {

    static String firstLine = "8";
    static String secondLine = "1 1 2 3 3 3 10 10";

    public static void summarize(String[] seq) {
        int groupSize = 1;
        for (int i = 0; i &lt; seq.length; i++) {
            if (i == seq.length - 1) {
                System.out.println(groupSize + " " + seq[i]);
            } else if (seq[i].equals(seq[i + 1])) {
                groupSize++;
            } else {
                System.out.print(groupSize + " " + seq[i] + " ");
                groupSize = 1;
            }
        }
    }

    public static void main(String[] args) {
        int arrayLen = Integer.parseInt(firstLine);
        String[] array = secondLine.split(" ");
        if (arrayLen != array.length) {   // Optional validation
            throw new IllegalArgumentException("Expected " + arrayLen + " numbers, got " + array.length);
        }
        summarize(array);
    }
}


I also propose the following algorithm, which does not need as much of a special case for handling the last element.

    public static void summarize(String[] seq) {
        int groupStart, groupEnd;
        for (groupStart = 0; groupStart &lt; seq.length; groupStart = groupEnd) {
            String leader = seq[groupStart];
            for (groupEnd = groupStart + 1; groupEnd &lt; seq.length &amp;&amp; seq[groupEnd].equals(leader); groupEnd++);
            System.out.print((groupEnd - groupStart) + " " + leader +
                             (groupEnd &lt; seq.length - 1 ? " " : "\n"));
        }
    }