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 listAug 7, 2024 12:59Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2024 12:5900000Error: expected "1020366 ", got "1020365 "stderr
2Aug 7, 2024 13:0000000Error: expected "1019924 ", got "1019923 "stderr
3Aug 7, 2024 13:0000000Error: expected "1025977 ", got "1025976 "stderr
4Aug 7, 2024 13:0000000Error: expected "1019132 ", got "1019131 "stderr
5Aug 7, 2024 13:0000000Error: expected "1024134 ", got "1024133 "stderr
6Aug 7, 2024 13:0100000Error: expected "1024328 ", got "1024327 "stderr