Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listJul 12, 2023 21:50gchebanovgchebanovScore: 4,208Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 21:504,180700,146,562626,979,742016,932,864
2Jul 12, 2023 21:504,182685,572,521627,250,745016,924,672
3Jul 12, 2023 21:504,205687,072,816630,750,811016,924,672
4Jul 12, 2023 21:504,208653,729,596604,135,00027,006,00017,076,224
5Jul 12, 2023 21:504,208654,516,024605,157,00026,006,00016,977,920
6Jul 12, 2023 21:504,208665,315,498609,166,00022,006,00017,043,456
7Jul 12, 2023 21:504,208656,478,539607,232,00024,009,00017,018,880
8Jul 12, 2023 21:504,210659,900,553609,454,00021,980,00017,080,320
9Jul 12, 2023 21:504,211655,080,741605,726,00025,988,00017,174,528
10Jul 12, 2023 21:504,212657,280,226608,827,00022,993,00017,162,240
11Jul 12, 2023 21:504,213655,598,286608,882,00022,995,00016,953,344
12Jul 12, 2023 21:504,216655,886,941603,474,00028,974,00016,969,728