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 8, 2024 07:11E SequeiraE SequeiraScore: 104,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 07:11104,1543,465,491,6133,375,131,00061,965,0002,285,568
2Dec 8, 2024 07:11104,2653,470,787,7783,386,797,00053,964,0002,375,680
3Dec 8, 2024 07:11105,0793,500,195,5513,412,643,00054,962,0002,281,472