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 listDec 7, 2023 12:17matsuoka-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
1Dec 7, 2023 12:1700000Error: expected "1021632 ", got "1021635 "stderr
2Dec 7, 2023 12:1800000Error: expected "1018983 ", got "1018982 "stderr
3Dec 7, 2023 12:1800000Error: expected "1022366 ", got "1022365 "stderr
4Dec 7, 2023 12:1900000Error: expected "1019223 ", got "1019224 "stderr
5Dec 7, 2023 12:1900000Error: expected "1021758 ", got "1021759 "stderr
6Dec 7, 2023 12:2000000Error: expected "1019537 ", got "1019534 "stderr
7Dec 7, 2023 12:2100000Error: expected "1024919 ", got "1024920 "stderr