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:24Bernard 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:2400000Error: expected "1018806 ", got "1018805"
2Aug 26, 2022 12:2411,019420,965,056363,634,50502,285,568
3Aug 26, 2022 12:2411,026430,175,843363,869,33302,289,664
4Aug 26, 2022 12:2411,036425,130,196364,198,21702,289,664
5Aug 26, 2022 12:2411,117448,382,657366,860,90802,285,568
6Aug 26, 2022 12:2411,159421,026,270368,235,92902,285,568
7Aug 26, 2022 12:2411,224424,103,319370,398,52902,285,568