Unique Numbers
Statement
Goal
Your aim is to take in N integers, compute their sum, and output True if the digits in the sum are all unique, and False if it is not.Input
Line 1: An integer N for the number of integers
Next N Lines: Integer x
Next N Lines: Integer x
Output
Line 1 : True or False
Constraints
1 <= N <= 9
0 <= x <= 9999999999
0 <= x <= 9999999999
Example
Input
1 10
Output
True
Game modes
Fastest, Shortest
Test cases
Test 1 Test
Input
1
10
Output
True
Validator 1 Validator
Input
1
33
Output
False
Test 2 Test
Input
1
123456789
Output
True
Validator 2 Validator
Input
1
987654321
Output
True
Test 3 Test
Input
1
112345678
Output
False
Validator 3 Validator
Input
1
223456789
Output
False
Test 4 Test
Input
2
10
1
Output
False
Validator 4 Validator
Input
2
20
2
Output
False
Test 5 Test
Input
3
100
20
3
Output
True
Validator 5 Validator
Input
3
200
30
4
Output
True
Test 6 Test
Input
5
20000
4000
300
20
1
Output
False
Validator 6 Validator
Input
5
50000
4000
300
20
2
Output
False
Test 7 Test
Input
5
10000
2000
300
40
5
Output
True
Validator 7 Validator
Input
5
12345
1000
100
10
1
Output
True
Hardest One Test
Input
9
101010101
90202020
3030303
404040
50505
6060
707
80
9
Output
True
Validator 8 Validator
Input
9
101010101
20202020
3030303
404040
50505
6060
707
80
9
Output
False
Limit Test Test
Input
9
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
Output
False
Validator 9 Validator
Input
9
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111110
Output
False
Solution language
Solution
Stub generator input