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 listOct 3, 2024 22:20Joad 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
1Oct 3, 2024 22:2000000Error: expected "1018720 ", got "1018688 "stderr
2Oct 3, 2024 22:2100000Error: expected "1023616 ", got "1023627 "stderr
3Oct 3, 2024 22:2100000Error: expected "1022219 ", got "1022193 "stderr
4Oct 3, 2024 22:2200000Error: expected "1020505 ", got "1020496 "stderr
5Oct 3, 2024 22:2200000Error: expected "1020010 ", got "1019963 "stderr