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 8, 2022 21:49deniskolsanovdeniskolsanovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2022 21:4900000Error: expected "1026539 ", got "10 24 40 51 55 67 72 78 92 105 113 123 138 144 156 162 169 182 193 202 218 224 230 242 254 261 265 280 293 308 323 339 345 361 368 373 377 393 403 410 426 438 449 460 474 482 498 508 515 526 541 557 569 576 585 593 608 ...