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 21:03Eugene ZhydzetskiEugene ZhydzetskiScore: 113,494Success
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 21:03113,0413,794,775,9303,730,339,49802,183,168
2Aug 4, 2022 21:03113,4943,815,804,4233,745,315,97702,297,856
3Aug 4, 2022 21:03114,0333,843,056,7033,763,103,73102,301,952