Отсортировать массив используя Comparator

package com.company;
 
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
 
public class Main {
 
public static void funk()throws FileNotFoundException{
    String path = 
"C:\\Users\\Ira\\Desktop\\PROGRAMMS\\JAVA\\1\\2\\out\\zfr.txt";
    File file = new File(path);
    Scanner scanner = new Scanner(file);
    String line = scanner.nextLine();
    String[] numbersString = line.split(" ");
    int[] numbers = new int[numbersString.length];
    int[] numberss = new int[numbersString.length];
    int counter = 0;
    for (String number : numbersString) {
        numbers[counter++] = Integer.parseInt(number);
    }
    System.out.println(Arrays.toString(numbers));
    scanner.close();
    System.out.print("[");
    for (int j=0;j<numbers.length;j++){
        int sum=0;
        while(numbers[j] != 0){
            sum += (numbers[j] % 10);
            numbers[j]/=10;
        }
        numberss[j]=sum;
        System.out.print(numberss[j] + " ");
    }
    System.out.println("]");
    java.util.Arrays.sort (numberss);
 
    System.out.print("[");
    for (int j=0;j<numbers.length;j++) {
        System.out.print(numberss[j] + " ");
    }
    System.out.println("]");
}
 
public static void main(String[] args) throws FileNotFoundException {
    funk();
}
}

public class Test implements Comparator <Integer> {
 
    @Override
    public int compare(Integer o1, Integer o2) {
        return o2-o1;
    }
}

Arrays.sort(numberss, new Test());