Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating resource.

Please try to avoid dependencies to third-party libraries and frameworks.

Implementation edit is for fixing errors and enhancing with metadata.

Instead of changing the code of the snippet, consider creating another Pascal implementation.

Other implementations
def multiplyWillOverflow(x,y):
	return False
import core.checkedint;
bool multiplyWillOverflow(int x, int y)
    bool result;
    core.checkedint.muls(x, y, result);
    return result;
func multiplyWillOverflow(x, y uint64) bool {
   if x <= 1 || y <= 1 {
     return false
   d := x * y
   return d/y != x
static boolean multiplyWillOverflow(int x, int y) {
	return Integer.MAX_VALUE/x < y;
function multiplyWillOverflow($x, $y)
      return ($x * $y) > PHP_INT_MAX;
def multiplyWillOverflow(x,y)
fn multiply_will_overflow(x: i64, y: i64) -> bool {
sub multiply_will_overflow {
    my ($x, $y) = @_;
    return 'Inf' eq $x * $y;
  logical function multiply_will_overflow (x, y) result(res)
    integer, intent(in) :: x, y
    integer, parameter :: ik = selected_int_kind (int(digits(y)*log10(2.)*2))

    res = int(x,kind=ik) * int(y,kind=ik) > huge(x)
  end function multiply_will_overflow
public bool WillOverwflow(int x, int y) => int.MaxValue / x < y;