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:32Andrey 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:3200000Error: expected "1024998 ", got "1024997 "stderr
2Jul 24, 2024 19:3300000Error: expected "1024223 ", got "1024222 "stderr
3Jul 24, 2024 19:3300000Error: expected "1020559 ", got "1020558 "stderr
4Jul 24, 2024 19:3500000Error: expected "1019055 ", got "1019054 "stderr
5Jul 24, 2024 19:3700000Error: expected "1022833 ", got "1022832 "stderr
6Jul 24, 2024 19:3700000Error: expected "1018146 ", got "1018145 "stderr
7Jul 24, 2024 19:3700000Error: expected "1023314 ", got "1023313 "stderr