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:54Dmitry 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:5400000Wrong answer: expected: 1034775 got: 1034773
2Apr 26, 2021 22:5500000Wrong answer: expected: 1036472 got: 1036471
3Apr 26, 2021 22:5500000Wrong answer: expected: 1040685 got: 1040682
4Apr 26, 2021 22:5500000Wrong answer: expected: 1040439 got: 1040435
5Apr 26, 2021 22:5600000Wrong answer: expected: 1034622 got: 1034619
6Apr 26, 2021 22:5700000Wrong answer: expected: 1042675 got: 1042672
7Apr 26, 2021 22:5700000Wrong answer: expected: 1037597 got: 1037593
8Apr 26, 2021 22:5800000Wrong answer: expected: 1040582 got: 1040578