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 3, 2024 19:58Jatin YadavJatin YadavScore: 108,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 19:58108,4253,613,614,8273,494,061,00083,953,0002,519,040
2Sep 3, 2024 19:58108,5993,613,007,0593,504,840,00078,928,0002,285,568
3Sep 3, 2024 19:58109,5393,644,980,9073,533,846,00080,927,0002,285,568