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 listSep 22, 2024 16:41Павел РатмановПавел РатмановScore: 96,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2024 16:4196,8423,221,881,7543,024,951,000170,827,0002,428,928
2Sep 22, 2024 16:4196,9653,233,696,0283,023,035,000176,826,0002,285,568
3Sep 22, 2024 16:4197,2653,239,651,4513,016,939,000192,804,0002,416,640