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 14, 2023 18:41АндрейАндрейError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2023 18:4100000Error: Exit with code 2: JGe YkH0yFeEvG WiDDHob5KEs6Vl AyoKm ZYFqL8RKD ypXfg4cTIv f1lBkVXXD@1pBw JdiGCdQGxK *2PQX7eOcSMD*bU ULw@e@5X#du8J QpPgGuq@I#VCb YanXseiT6yp9D QJVNcek5BzZncbZ hX9Ktc9O9xle OO8Un# vBvmTMl4o*O7X oEF 79M6jt09fL5 v1*zuCAtmRvyLg #*bV%...stderr