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:44matsuoka-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:4400000Error: expected "1024521 ", got "85 1024515 "
2Sep 3, 2023 08:4400000Error: expected "1019753 ", got "82 1019756 "
3Sep 3, 2023 08:4500000Error: expected "1023214 ", got "84 1023227 "
4Sep 3, 2023 08:4700000Error: expected "1017848 ", got "85 1017850 "
5Sep 3, 2023 08:4800000Error: expected "1018841 ", got "86 1018831 "