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 29, 2022 10:09Bernard 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 29, 2022 10:0900000Error: expected "1022093 ", got "1022092"
2Aug 29, 2022 10:2700000Error: expected "1023652 ", got "1023651"
3Aug 29, 2022 10:1010,174415,727,755335,742,36802,179,072
4Aug 29, 2022 10:2710,194400,275,676336,412,41002,301,952
5Aug 29, 2022 10:1010,261413,802,457338,618,80902,174,976
6Aug 29, 2022 10:1010,262405,230,359338,651,75402,293,760
7Aug 29, 2022 10:2710,266419,037,815338,766,72202,306,048
8Aug 29, 2022 10:2710,587408,408,442349,368,99202,179,072