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 3, 2021 04:36Ilya AniskovetsIlya AniskovetsScore: 41,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2021 04:3641,4601,428,802,2021,368,172,49802,220,032
2Sep 3, 2021 04:3641,6241,436,620,5151,373,605,24302,179,072
3Sep 3, 2021 04:3641,8011,451,111,3971,379,428,26402,260,992