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 listJul 14, 2022 10:02Dmitry IvanovDmitry IvanovScore: 469,653Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2022 10:02467,98015,498,022,67515,443,348,97802,256,896
2Jul 14, 2022 10:02469,65315,577,980,29115,498,554,55202,199,552
3Jul 14, 2022 10:02470,94815,607,459,49915,541,282,12002,236,416