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 17, 2025 07:40Ian MckibbenIan MckibbenScore: 24,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2025 07:4024,667838,532,833739,000,00075,000,0002,289,664
2Feb 17, 2025 07:4024,816844,816,511735,947,00082,994,0002,285,568
3Feb 17, 2025 07:4024,838843,040,944732,681,00086,962,0002,285,568