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 03:55matsuoka-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 03:5500000Error: expected "1020638 ", got "1020646 "stderr
2Sep 3, 2023 03:5600000Error: expected "1023620 ", got "1023621 "stderr
3Sep 3, 2023 03:5800000Error: expected "1025783 ", got "1025785 "stderr
4Sep 3, 2023 03:5900000Error: expected "1021029 ", got "1021034 "stderr
5Sep 3, 2023 04:0000000Error: expected "1023908 ", got "1023918 "stderr
6Sep 3, 2023 04:0100000Error: expected "1020265 ", got "1020270 "stderr
7Sep 3, 2023 04:0200000Error: expected "1021909 ", got "1021916 "stderr
8Sep 3, 2023 04:0300000Error: expected "1018387 ", got "1018384 "stderr
9Sep 3, 2023 04:0400000Error: expected "1020885 ", got "1020890 "stderr