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 listMar 26, 2023 16:29Sergey StreminSergey StreminScore: 19,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 16:3019,417724,155,882640,757,98202,236,416
2Mar 26, 2023 16:2919,509709,942,975643,796,25902,232,320
3Mar 26, 2023 16:3019,614716,530,924647,263,50702,236,416
4Mar 26, 2023 16:2919,662705,027,441648,848,97502,228,224
5Mar 26, 2023 16:3019,673714,891,218649,199,86002,236,416
6Mar 26, 2023 16:2919,727723,257,688650,977,07702,236,416