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 13, 2025 17:40Rajarshi BasuRajarshi BasuScore: 10,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2025 17:4010,066356,618,510316,176,00016,008,0002,412,544
2Dec 13, 2025 17:4010,071360,061,553318,321,00014,014,0002,285,568
3Dec 13, 2025 17:4010,751386,799,310341,784,00012,991,0002,473,984