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:33Bernard 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:3300000Error: expected "1019266 ", got "0 0 901010101010102 90a0b0c0d0e0f11 10203040e 10203040e e 14 235929618 ff0000000000 -10000000000 101010102 102030406 a 6 6 20 235929629 ff000000 -1000000 10102 10204 1020c 10204 4 24 235929639 -100000000000000 -10000000...