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 listOct 11, 2022 16:45Kenneth MaplesKenneth MaplesScore: 284,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2022 16:45284,4359,453,190,5679,386,363,86402,314,240
2Oct 11, 2022 16:45284,9649,468,528,2549,403,815,66102,310,144
3Oct 11, 2022 16:45285,8499,496,293,6699,433,018,13202,281,472