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 27, 2021 06:13Dmitry 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 27, 2021 06:1300000Wrong answer: expected: 1034995 got: 1034990
2Apr 27, 2021 06:1300000Wrong answer: expected: 1034497 got: 1034496
3Apr 27, 2021 06:1300000Wrong answer: expected: 1040838 got: 1040836
4Apr 27, 2021 06:1400000Wrong answer: expected: 1035765 got: 1035763
5Apr 27, 2021 06:1400000Wrong answer: expected: 1034556 got: 1034553
6Apr 27, 2021 06:1400000Wrong answer: expected: 1040923 got: 1040924
7Apr 27, 2021 06:1400000Wrong answer: expected: 1036406 got: 1036403