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 20, 2025 14:03Rajarshi BasuRajarshi BasuScore: 5,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 14:035,087191,375,982163,861,0003,996,0002,379,776
2Dec 20, 2025 14:035,096196,660,166164,178,0004,004,0002,326,528
3Dec 20, 2025 14:035,140195,208,104164,625,0004,988,0002,519,040