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 listSep 17, 2021 20:35Malik ShamsutdinovMalik ShamsutdinovScore: 98,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2021 20:3596,1773,236,554,9053,173,846,58102,187,264
2Sep 17, 2021 20:3598,6853,335,951,9063,256,598,19902,306,048
3Sep 17, 2021 20:3599,2643,359,246,5863,275,717,91502,314,240