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 listNov 26, 2022 14:44Kenneth MaplesKenneth MaplesScore: 55,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2022 14:4455,1371,883,207,0741,819,520,60702,273,280
2Nov 26, 2022 14:4455,3801,906,804,6811,827,530,77902,256,896
3Nov 26, 2022 14:4456,0211,917,502,2201,848,703,84602,252,800