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:00Bernard 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:0000000Error: expected "1024278 ", got "1024277"
2Aug 26, 2022 12:0010,561414,298,015348,516,93102,252,800
3Aug 26, 2022 12:0010,641408,503,703351,166,47302,285,568
4Aug 26, 2022 12:0010,689413,941,881352,753,18002,273,280
5Aug 26, 2022 12:0010,691423,163,222352,799,78902,293,760
6Aug 26, 2022 12:0010,702421,924,677353,177,23602,252,800
7Aug 26, 2022 12:0010,712411,910,028353,498,40602,281,472