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 22:38gchebanovgchebanovScore: 4,220Success
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 22:384,173692,529,913625,962,778016,920,576
2Jul 12, 2023 22:384,187689,563,364627,981,418016,928,768
3Jul 12, 2023 22:384,214657,714,850604,166,00028,007,00017,068,032
4Jul 12, 2023 22:384,216690,079,497632,458,007016,928,768
5Jul 12, 2023 22:384,219655,215,580609,828,00022,993,00017,084,416
6Jul 12, 2023 22:384,220655,618,339609,939,00022,997,00017,076,224
7Jul 12, 2023 22:384,220665,887,307601,991,00030,999,00017,080,320
8Jul 12, 2023 22:384,221662,025,782610,146,00023,005,00017,018,880
9Jul 12, 2023 22:384,222654,411,226607,219,00026,009,00017,076,224
10Jul 12, 2023 22:384,223663,969,967609,541,00023,981,00017,137,664
11Jul 12, 2023 22:384,225654,929,950604,705,00028,985,00017,014,784
12Jul 12, 2023 22:384,230664,768,352601,468,00032,970,00016,998,400