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 listJul 11, 2024 13:28Joad 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
1Jul 11, 2024 13:2800000Error: expected "1020324 ", got "1020323 "stderr
2Jul 11, 2024 13:2900000Error: expected "1025079 ", got "1025078 "stderr
3Jul 11, 2024 13:4000000Error: expected "1021136 ", got "1021134 "stderr
4Jul 11, 2024 17:3000000Error: expected "1026451 ", got "1026450 "stderr
5Jul 11, 2024 17:3900000Error: expected "1020982 ", got "1020981 "stderr