Editorial

Since $a, b \leq 1 0^{9}$ , then $a \cdot b \leq 1 0^{18}$ . Therefore, a $64$ -bit long long type should be used.

Algorithm realization

Read the values of the variables $a$ and $b$ .

scanf("%lld %lld", &a, &b);

Compute and print the product $a \cdot b$ .

p = a * b;
printf("%lld\n", p);

Java realization

import java.util.*;

public class Main
{
  public static void main(String[] args)
  {
    Scanner con = new Scanner(System.in);
    long a = con.nextLong();
    long b = con.nextLong();
    long res = a * b;
    System.out.println(res);
    con.close();
  }
}

Python realization

Read the values of the variables $a$ and $b$ .

a, b = map(int,input().split())

Compute and print the product $a \cdot b$ .

res = a * b
print(res)