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 14, 2025 14:03Rajarshi BasuRajarshi BasuScore: 8,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 14, 2025 14:038,106295,400,900259,519,0007,985,0002,506,752
2Dec 14, 2025 14:038,118296,689,511258,894,0008,996,0002,510,848
3Dec 14, 2025 14:038,295304,159,905263,758,0009,990,0002,502,656