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 10, 2023 04:01Sedat KapanoğluSedat KapanoğluError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2023 04:0100000Error: Exit with code 101: thread 'main' panicked at 'called `Result::unwrap()` on an `Err` value: TryFromSliceError(())', solve.rs:12:51 note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr