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 11, 2023 11:22CadovvlCadovvlError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2023 11:2100000Error: expected "1023408 ", got "0"
2Aug 11, 2023 11:22328,25010,899,973,81310,832,243,22502,252,800
3Aug 11, 2023 11:22329,23010,931,751,19210,864,591,38102,306,048
4Aug 11, 2023 11:22331,48111,025,921,85110,938,889,17102,260,992