New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Multiply Strings

Medium

0/80

Avg time to solve 35 mins

Success Rate 55 %

38 upvotes

Problem Statement

You are given two big numbers ‘A’ and ‘B’ as strings. Your task is to find the product of both the numbers.

Note:

There are no leading zeros in both the strings, except the number 0 itself.
Do not use any built-in Big Integer Library.

For Example:

If, A = 123, and B = 456.
So the product of both numbers will be 56088.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input format:

The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then, the T test cases follow.

The first line of each test case contains a number ‘A’ as a string.
The second line of each test case contains the number ‘B’ as a string.

Output format:

For each test case, print the product of both the numbers, ‘A’ and ‘B’ in a separate line.

Note:

You do not need to print anything. It has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 100
1 <= |A|, |B| <= 100

where |A| and |B| denote the length of string, ‘A’ and ‘B’ respectively.   
All the characters of the string ‘A’ and ‘B’ contain digits only.

Time limit: 1 second

Sample Input 1:

Sample Output 1:

1577340556
56088

Explanation for sample 1:

For the first test case:
A=17281, and B=91276
The product of both numbers is 1577340556.

For the second test case:
A=123, B=456
The product of both numbers is 56088

Sample Input 2:

1
5
10

Sample output 2:

Auto

Console