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 listAug 27, 2022 06:41Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2022 06:4100000Error: expected "1021119 ", got "3dfec6 5e5e5041838d4e27 1c5c9f 60645f063a39b468 3175c2 4c4a7844a4c7e059 5081b 7e50465da16c2b8d 267c69 78405e41c44fba18 234b63 70443c69421feeba 228a21 606c3c5e6a9b97ca 784e3 726e7e6d44cfaacb 643c6 58203a45b041ee59 1720bf...