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 listMay 14, 2023 18:40АндрейАндрейError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2023 18:4000000Error: Exit with code 2: [48 70 80 66 85 10][53 53 78 118 90 74 78 50 48 49 48 114 110 10][122 73 121 75 103 35 52 65 115 79 10][72 65 103 53 78 51 10][97 65 35 42 114 116 78 81 116 10][74 56 49 10][72 79 42 104 72 68 103 109 121 10][64 57 118 56 10][7...stderr