Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listApr 26, 2021 21:47Dmitry DolgopolovDmitry DolgopolovError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2021 21:4700000Wrong answer: expected: 1037516 got: 1037506
2Apr 26, 2021 21:4800000Wrong answer: expected: 1036867 got: 1036857
3Apr 26, 2021 21:4800000Wrong answer: expected: 1042145 got: 1042136
4Apr 26, 2021 21:4900000Wrong answer: expected: 1040335 got: 1040324
5Apr 26, 2021 21:5000000Wrong answer: expected: 1042137 got: 1042127
6Apr 26, 2021 21:5000000Wrong answer: expected: 1041393 got: 1041379
7Apr 26, 2021 21:5000000Wrong answer: expected: 1040064 got: 1040050
8Apr 26, 2021 21:5000000Wrong answer: expected: 1042117 got: 1042105
9Apr 26, 2021 21:5000000Wrong answer: expected: 1039555 got: 1039543
10Apr 26, 2021 21:5300000Wrong answer: expected: 1033869 got: 1033858