Euler Problem 7 - 10001st Prime Number - Prime Sieve - Simple Programming in Python

Project Euler's seventh problem is about finding a certain prime number. Primes are interesting and finding them is not trivial, though a prime sieve works well for this problem.

[hiking]

I made it like this in java and it takes 3 sec. Idk if its that good:
int num = 0;
int counter = 0;
List<Integer> list = new ArrayList<>();
for (int i = 2; num != 10001; i++) {
for (Integer n : list) {
if (i % n == 0) {
counter++;
}
}
if (counter == 0) {
list.add(i);
num++;
} else counter = 0;
}

}