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 listFeb 16, 2023 19:04LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2023 19:0300000Error: expected "1019379 ", got "1019377 "
2Feb 16, 2023 19:0485,0872,868,882,3722,807,871,41302,289,664
3Feb 16, 2023 19:0485,4262,884,616,2082,819,061,28002,293,760
4Feb 16, 2023 19:0485,6812,899,482,4772,827,479,73302,301,952