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 listSep 3, 2023 08:51matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2023 08:5100000Error: expected "1026426 ", got "153 1026424 "
2Sep 3, 2023 08:5200000Error: expected "1021790 ", got "156 1021790 "
3Sep 3, 2023 08:5300000Error: expected "1019607 ", got "155 1019611 "
4Sep 3, 2023 08:5400000Error: expected "1023728 ", got "156 1023737 "
5Sep 3, 2023 08:5500000Error: expected "1019118 ", got "157 1019121 "