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 listJun 16, 2023 18:12Victor MuñozVictor MuñozError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2023 18:1200000Error: expected "1019905 ", got "mayor a 10 7 17911 274 mayor a 10 6 29134 210 mayor a 10 6 143854 188 mayor a 10 6 156349 158 mayor a 10 7 172678 182 mayor a 10 6 208655 201 mayor a 10 7 251172 222 mayor a 10 6 271836 194 mayor a 10 6 ...stderr