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 listDec 17, 2025 18:51Rajarshi BasuRajarshi BasuScore: 14,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 18:5114,128491,774,607458,220,0008,003,0002,281,472
2Dec 17, 2025 18:5114,160496,454,426463,281,0004,002,0002,510,848
3Dec 17, 2025 18:5114,182497,000,919465,021,0003,000,0002,510,848