not fast enough

CountNonDivisible

import java.util.stream.IntStream;
import java.util.stream.Collectors;
import java.util.List;
import java.util.Arrays;
class Solution {
    public int[] solution(int[] A) {
        // write your code in Java SE 8
        int result[]=new int[A.length];
        List<Integer> sorted=IntStream.of(A).sorted().boxed().collect(Collectors.toList());
                
        for(int index=0;index<A.length;index++){
           int start=0;
           int indexOf=sorted.lastIndexOf(A[index]);
           int count=sorted.size()-1-indexOf;
            for(int x=1;x<=indexOf;x++){                
                if(sorted.get(indexOf)!=sorted.get(indexOf-x)&&sorted.get(indexOf)%sorted.get(indexOf-x)!=0){
                    count++;
                }
                
            }
            result[index]=count;
        }
        return result;
    }
}