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 25, 2024 23:03Andrey LikhachevAndrey LikhachevError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2024 23:0300000Error: expected "1023930 ", got "1023929 "stderr
2Jul 25, 2024 23:0700000Error: expected "1018468 ", got "1018467 "stderr
3Jul 25, 2024 23:0700000Error: expected "1026813 ", got "1026811 "stderr
4Jul 25, 2024 23:0800000Error: expected "1021243 ", got "1021241 "stderr
5Jul 25, 2024 23:0800000Error: expected "1024218 ", got "1024216 "stderr
6Jul 25, 2024 23:0900000Error: expected "1024084 ", got "1024083 "stderr