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 31, 2025 19:57Павел РатмановПавел РатмановScore: 73,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 19:5773,6972,460,547,2462,410,010,00021,990,0002,392,064
2Dec 31, 2025 19:5773,7452,461,560,5022,406,615,00026,984,0002,281,472
3Dec 31, 2025 19:5773,9372,468,578,2952,415,927,00023,989,0002,404,352