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:24Rajarshi BasuRajarshi BasuScore: 18,610Success
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:2418,423635,845,731593,976,00013,999,0002,330,624
2Dec 13, 2025 16:2418,610648,792,495594,164,00019,971,0002,519,040
3Dec 13, 2025 16:2418,622640,823,371604,520,0009,992,0002,334,720