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 9, 2022 17:13Edoardo AnnunziataEdoardo AnnunziataScore: 464,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2022 17:13463,66815,359,415,51515,301,046,44802,220,032
2Aug 9, 2022 17:13464,65515,397,518,88215,333,616,37102,314,240
3Aug 9, 2022 17:13466,12415,444,157,70615,382,093,59902,211,840