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:16Bernard 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:1600000Error: expected "1023341 ", got "1023340"
2Aug 28, 2022 08:1600000Error: expected "1024689 ", got "1024687"
3Aug 28, 2022 08:1610,336399,037,963341,095,18702,220,032
4Aug 28, 2022 08:1610,399408,951,033343,167,02702,232,320
5Aug 28, 2022 08:1610,444407,305,206344,666,81802,236,416