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 16:30Bernard TeoBernard TeoScore: 3,386Success
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 16:303,356178,171,903110,731,85702,174,976
2Aug 31, 2022 16:303,379178,113,139111,503,29102,289,664
3Aug 31, 2022 16:313,384192,862,992111,664,19002,293,760
4Aug 31, 2022 16:313,386182,887,265111,738,48602,301,952
5Aug 31, 2022 16:313,399180,873,265112,160,22702,174,976
6Aug 31, 2022 16:303,407169,601,063112,424,20002,289,664