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 31, 2022 05:02wireless anonwireless anonScore: 96,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2022 05:0292,9123,144,560,3073,066,084,77402,236,416
2Aug 31, 2022 05:0294,6963,195,117,2553,124,970,34202,281,472
3Aug 31, 2022 05:0296,4693,242,420,6093,183,491,20602,244,608
4Aug 31, 2022 05:0296,7783,250,951,7123,193,658,14402,232,320
5Aug 31, 2022 05:0297,1323,270,421,8343,205,348,70702,265,088
6Aug 31, 2022 05:0297,8263,298,476,2583,228,253,38802,228,224