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 28, 2022 07:43Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2022 07:4300000Error: expected "1019226 ", got "1019225"
2Aug 28, 2022 07:4400000Error: expected "1019085 ", got "1019084"
3Aug 28, 2022 07:4310,469422,919,792345,483,60402,269,184
4Aug 28, 2022 07:4310,516411,180,171347,011,70502,269,184
5Aug 28, 2022 07:4311,267439,079,068371,818,84802,273,280