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 23, 2021 01:34Vasily TitskiyVasily TitskiyScore: 75,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2021 01:2774,7372,524,080,7702,466,312,04802,228,224
2May 23, 2021 01:2774,9032,536,452,8452,471,788,29502,236,416
3May 23, 2021 01:3474,9352,530,284,0632,472,867,00902,232,320
4May 23, 2021 01:3475,0262,544,109,8892,475,862,45802,244,608
5May 23, 2021 01:2775,2022,542,273,6002,481,675,55202,240,512
6May 23, 2021 01:3475,4212,545,380,6342,488,894,26602,240,512