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 listAug 4, 2022 20:27Eugene ZhydzetskiEugene ZhydzetskiScore: 97,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2022 20:2797,2373,271,233,9213,208,808,18002,207,744
2Aug 4, 2022 20:2797,2463,266,392,8313,209,110,08602,310,144
3Aug 4, 2022 20:2797,9553,311,514,4463,232,515,88002,211,840