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 listMar 29, 2024 05:31woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 339,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2024 05:31336,91611,323,936,46011,118,225,51202,269,184
2Mar 29, 2024 05:31339,61411,357,894,51311,207,247,15202,207,744
3Mar 29, 2024 05:31340,97511,446,406,19211,252,178,64302,228,224