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 16:25Rajarshi BasuRajarshi BasuScore: 19,667Success
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 16:2519,631675,338,549629,830,00017,995,0002,457,600
2Dec 13, 2025 16:2519,667679,383,086631,016,00018,000,0002,355,200
3Dec 13, 2025 16:2519,953684,011,124642,476,00015,986,0002,310,144