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 27, 2022 13:23Bernard TeoBernard TeoScore: 11,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2022 13:2311,248450,129,175371,197,84202,285,568
2Aug 27, 2022 13:2311,252443,196,231371,325,14302,289,664
3Aug 27, 2022 13:2311,281428,825,163372,261,58702,281,472
4Aug 27, 2022 13:2311,311437,426,196373,269,22702,281,472
5Aug 27, 2022 13:2311,350440,726,765374,546,47602,285,568
6Aug 27, 2022 13:2311,408440,559,259376,451,24702,248,704