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 listDec 26, 2023 13:13Andrey LikhachevAndrey LikhachevScore: 4,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2023 13:134,160684,995,373623,945,612016,953,344
2Dec 26, 2023 13:134,172688,078,479625,816,905016,936,960
3Dec 26, 2023 13:134,182684,610,164627,373,736016,945,152
4Dec 26, 2023 13:134,247669,680,573627,035,0009,984,00016,420,864
5Dec 26, 2023 13:134,248669,871,459626,146,00010,985,00016,420,864
6Dec 26, 2023 13:134,254667,329,525629,106,0008,987,00016,404,480
7Dec 26, 2023 13:134,255674,782,337625,294,00012,985,00016,171,008
8Dec 26, 2023 13:134,264669,156,719630,657,0008,980,00016,400,384
9Dec 26, 2023 13:134,271672,277,679629,635,00010,976,00016,420,864
10Dec 26, 2023 13:134,272665,601,539632,874,0007,985,00016,171,008
11Dec 26, 2023 13:134,351680,576,723646,725,0005,988,00016,424,960
12Dec 26, 2023 13:134,361680,490,444651,214,0002,996,00016,179,200