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 listApr 26, 2021 22:50Dmitry DolgopolovDmitry DolgopolovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2021 22:5000000Wrong answer: expected: 1034780 got: 1034771
2Apr 26, 2021 22:5100000Wrong answer: expected: 1033678 got: 1033672
3Apr 26, 2021 22:5100000Wrong answer: expected: 1039667 got: 1039661
4Apr 26, 2021 22:5100000Wrong answer: expected: 1038973 got: 1038969
5Apr 26, 2021 22:5300000Wrong answer: expected: 1041710 got: 1041704
6Apr 26, 2021 22:5300000Wrong answer: expected: 1037559 got: 1037552
7Apr 26, 2021 22:5300000Wrong answer: expected: 1037509 got: 1037504
8Apr 26, 2021 22:5300000Wrong answer: expected: 1036265 got: 1036257