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 23:02Dmitry 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 23:0200000Wrong answer: expected: 1036190 got: 1036189
2Apr 26, 2021 23:0200000Wrong answer: expected: 1037449 got: 1037448
3Apr 26, 2021 23:0200000Wrong answer: expected: 1034346 got: 1034345
4Apr 26, 2021 23:0200000Wrong answer: expected: 1041983 got: 1041979
5Apr 26, 2021 23:0300000Wrong answer: expected: 1041461 got: 1041457
6Apr 26, 2021 23:0300000Wrong answer: expected: 1037060 got: 1037056
7Apr 26, 2021 23:0300000Wrong answer: expected: 1040206 got: 1040203
8Apr 26, 2021 23:0500000Wrong answer: expected: 1039548 got: 1039545
9Apr 26, 2021 23:0500000Wrong answer: expected: 1034285 got: 1034283
10Apr 26, 2021 23:0500000Wrong answer: expected: 1040648 got: 1040647