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:41woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 343,357Success
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:41342,25811,464,506,92911,294,518,25202,281,472
2Mar 29, 2024 05:41343,35711,493,681,30011,330,783,94802,236,416
3Mar 29, 2024 05:41346,66911,625,623,83411,440,077,48702,236,416