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 16:23Rajarshi BasuRajarshi BasuScore: 151,155Success
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 16:23150,1234,988,527,8504,933,078,00020,983,0002,371,584
2Dec 20, 2025 16:23151,1555,019,161,8364,961,136,00026,984,0002,383,872
3Dec 20, 2025 16:23151,7995,040,147,4574,979,379,00029,984,0002,494,464