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 12, 2025 14:53Rajarshi BasuRajarshi BasuScore: 12,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2025 14:5311,503404,217,331372,620,0006,992,0002,281,472
2Dec 12, 2025 14:5312,080426,775,354390,661,0007,993,0002,310,144
3Dec 12, 2025 14:5312,216431,659,103395,140,0008,002,0002,506,752