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 listFeb 10, 2025 14:12E SequeiraE SequeiraScore: 102,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 14:12101,5153,383,598,4633,339,001,00010,993,0002,281,472
2Feb 10, 2025 14:12102,6903,415,431,0433,373,782,00014,990,0002,281,472
3Feb 10, 2025 14:12103,3553,450,491,8313,396,728,00013,990,0002,281,472