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:43woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 345,103Success
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:43344,20711,556,739,39011,358,830,90702,252,800
2Mar 29, 2024 05:43345,10311,570,907,43111,388,398,25902,195,456
3Mar 29, 2024 05:43346,35811,596,020,34111,429,808,09902,224,128