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 8, 2021 09:47Mikhail ShirokovMikhail ShirokovScore: 155,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2021 09:47154,6175,159,041,8685,102,372,36602,301,952
2Sep 8, 2021 09:47155,3935,188,627,4365,127,956,21602,297,856
3Sep 8, 2021 09:47156,0135,208,878,8205,148,426,87602,285,568