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:40matsuoka-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:4000000Error: expected "1018563 ", got "1018562 "stderr
2Sep 3, 2023 08:4100000Error: expected "1019671 ", got "1019665 "stderr
3Sep 3, 2023 08:4100000Error: expected "1023558 ", got "1023560 "stderr
4Sep 3, 2023 08:4200000Error: expected "1024418 ", got "1024404 "stderr
5Sep 3, 2023 08:4200000Error: expected "1024999 ", got "1024986 "stderr
6Sep 3, 2023 08:4300000Error: expected "1018415 ", got "1018422 "stderr