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:03Yurkov 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:0300000Wrong answer: expected: 1039189 got: 0=0|0, 1=1702|66, 2=112113|4356, 3=1795422|69706, 4=2070596|80414, 5=2074067|80604, 6=2073930|80533, 7=2069986|80449, 8=2065695|80182, 9=2075794|80632, 10=2060917|80053, 11=2055674|79855, 12=2068265|80232, 13=2080...