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 listMay 5, 2021 13:02Yurkov AlekseyYurkov AlekseyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 13:0200000Wrong answer: expected: 1041780 got: 0=0|80228, 1=1645|80508, 2=112356|84736, 3=1814407|150871, 4=2067082|160926, 5=2082308|161590, 6=2062624|161343, 7=2080996|161578, 8=2060905|0, 9=2068393|0, 10=2064214|0, 11=2064310|0, 12=2066654|0, 13=2072889|0, ...