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 08:26Bernard 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 08:2600000Error: expected "1018439 ", got "1018438"
2Aug 28, 2022 08:2600000Error: expected "1024208 ", got "1024207"
3Aug 28, 2022 08:2610,355405,997,331341,719,97102,306,048
4Aug 28, 2022 08:2610,388413,180,545342,818,48202,301,952
5Aug 28, 2022 08:2610,439401,245,993344,494,29402,252,800