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 22, 2021 06:19evgenikwtevgenikwtScore: 215,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 05:39213,3457,095,555,6237,040,379,18402,293,760
2May 22, 2021 06:19213,3847,106,219,6767,041,681,59102,273,280
3May 22, 2021 05:39214,1397,135,399,0457,066,591,21802,220,032
4May 22, 2021 06:19215,1117,160,004,9577,098,662,01502,228,224
5May 22, 2021 05:39215,7907,177,991,9597,121,070,03402,199,552
6May 22, 2021 06:19215,9927,184,134,9427,127,740,00502,301,952