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 listMay 24, 2021 00:58evgenikwtevgenikwtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 01:2000000Wrong answer: expected "1041983 ", got "1041982"
2May 24, 2021 00:5850,0011,706,909,4801,650,035,62502,256,896
3May 24, 2021 00:5850,1401,744,548,1551,654,634,88202,244,608
4May 24, 2021 00:5852,1391,779,420,6691,720,600,72002,244,608