Submit solution

Points:
4 (partial)

Time limit:
5.0s

Memory limit:
64M

Author:

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Given a list of () positive integers less than or equal to , print out how many distinct numbers exist.

#### Input Specification

The first line will contain the integer . The next lines will contain an element in the list.

#### Output Specification

One integer: the number of distinct elements in the given list.

#### Sample Input 1

```
2
1
2
```

#### Sample Output 1

`2`

#### Sample Input 2

```
4
1
2
2
5
```

#### Sample Output 2

`3`

## Comments

.

Can someone look at my solution. I don't understand why it isn't working.

EDIT: Don't worry fixed the problem. Just needed to sort.

this is so sad

You one-liners make me feel bad...

Hint: sets have very fast O(1)

`in`

checks, whereas lists have very slow O(n)`in`

checks. Your solution will probably pass if you use a set, but you may have to combine your two for loops into one.It appears that your solution doesn't have the intended complexity (the real testdata used to have N <= 20). As such, the limits have been increased and solutions have been rejudged :)