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 24, 2024 19:39Andrey 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 24, 2024 19:3900000Error: expected "1024955 ", got "1024956 "stderr
2Jul 24, 2024 19:3900000Error: expected "1024150 ", got "1024149 "stderr
3Jul 24, 2024 19:4000000Error: expected "1025692 ", got "1025693 "stderr
4Jul 24, 2024 19:4300000Error: expected "1023344 ", got "1023343 "stderr
5Jul 24, 2024 19:4400000Error: expected "1026237 ", got "1026235 "stderr
6Jul 24, 2024 19:4400000Error: expected "1019559 ", got "1019556 "stderr