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 20:47gchebanovgchebanovScore: 4,600Success
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 20:474,500697,349,991647,034,00027,958,00017,088,512
2Jul 12, 2023 20:474,523704,522,445650,445,00027,976,00017,076,224
3Jul 12, 2023 20:474,561771,597,088684,081,598016,920,576
4Jul 12, 2023 20:474,577748,176,973686,623,266016,924,672
5Jul 12, 2023 20:474,584758,818,973687,632,515016,928,768
6Jul 12, 2023 20:474,588715,099,461661,174,00026,966,00017,125,376
7Jul 12, 2023 20:474,600717,139,972665,987,00023,999,00017,084,416
8Jul 12, 2023 20:474,606715,676,759661,892,00028,995,00017,129,472
9Jul 12, 2023 20:474,608721,117,097662,171,00028,963,00016,982,016
10Jul 12, 2023 20:474,614724,953,160663,037,00029,001,00017,076,224
11Jul 12, 2023 20:474,623717,515,905668,420,00024,978,00017,084,416
12Jul 12, 2023 20:474,630723,656,917665,565,00028,981,00017,084,416