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 listSep 2, 2021 12:37Ilya AniskovetsIlya AniskovetsScore: 62,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2021 12:3759,9465,496,919,8551,978,229,48002,166,784
2Sep 2, 2021 12:3860,3586,200,909,5641,991,801,78502,183,168
3Sep 2, 2021 12:3862,2716,405,012,8312,054,933,87902,285,568
4Sep 2, 2021 12:3762,3625,864,579,9222,057,933,90002,244,608
5Sep 2, 2021 12:3763,6727,011,131,8692,101,170,42102,220,032
6Sep 2, 2021 12:3863,7886,472,279,1822,105,006,61702,265,088