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 listAug 2, 2022 06:53someone12469someone12469Score: 13,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 06:5312,143471,643,661400,712,32402,289,664
2Aug 2, 2022 06:5312,424466,936,950409,986,68002,293,760
3Aug 2, 2022 06:5312,439468,456,839410,481,21602,281,472
4Aug 2, 2022 16:2613,234507,646,997436,713,59402,289,664
5Aug 2, 2022 16:2613,392495,090,531441,921,30202,285,568
6Aug 2, 2022 16:2613,684527,486,396451,571,70002,285,568