chore: fix slow running intel-pmu test

[powersj]

The makeEvents call is very expensive in terms of both memory usage and
compute time. In order to reduce pressure on a system during tests, this
reduces the number of events, but increases the number of total cores.

[telegraf-tiger]

Download PR build artifacts for linux_amd64.tar.gz, darwin_amd64.tar.gz, and windows_amd64.zip.
Downloads for additional architectures and packages are available below.

👍 This pull request doesn't change the Telegraf binary size

📦 Click here to get additional PR build artifacts

Artifact URLs

DEB	RPM	TAR GZ	ZIP
amd64.deb	aarch64.rpm	darwin_amd64.tar.gz	windows_amd64.zip
arm64.deb	armel.rpm	darwin_arm64.tar.gz	windows_i386.zip
armel.deb	armv6hl.rpm	freebsd_amd64.tar.gz
armhf.deb	i386.rpm	freebsd_armv7.tar.gz
i386.deb	ppc64le.rpm	freebsd_i386.tar.gz
mips.deb	riscv64.rpm	linux_amd64.tar.gz
mipsel.deb	s390x.rpm	linux_arm64.tar.gz
ppc64el.deb	x86_64.rpm	linux_armel.tar.gz
riscv64.deb		linux_armhf.tar.gz
s390x.deb		linux_i386.tar.gz
		linux_mips.tar.gz
		linux_mipsel.tar.gz
		linux_ppc64le.tar.gz
		linux_riscv64.tar.gz
		linux_s390x.tar.gz
		static_linux_amd64.tar.gz

[sspaink]

This seems fine, I don't have a lot of knowledge about this. I assume we don't need a test for large number of events?

[powersj]

This seems fine, I don't have a lot of knowledge about this. I assume we don't need a test for large number of events?

Looked at the functions called by the test, the only thing we are testing with a large number of events is a for loop in estimateCoresFd and some math in multiplyAndAdd. The math is using uint64 and has checks if the value overflows, but this was not testing that anyway.