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 26, 2022 12:42Bernard 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 26, 2022 12:4400000Error: expected "1018752 ", got "1018751"
2Aug 26, 2022 12:5600000Error: expected "1018634 ", got "1018632"
3Aug 26, 2022 12:4211,873451,996,490391,816,79002,248,704
4Aug 26, 2022 12:4211,903459,067,899392,785,57202,285,568
5Aug 26, 2022 12:4212,044454,982,771397,457,56102,277,376