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:37woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 343,641Success
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:37342,22711,474,396,76711,293,486,39002,232,320
2Mar 29, 2024 05:37343,64111,547,909,05711,340,151,20402,256,896
3Mar 29, 2024 05:37343,97811,532,812,78911,351,260,75502,244,608