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 listNov 7, 2024 20:14spacecat8086spacecat8086Score: 382,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 20:14381,50257,287,250,53957,190,360,00034,979,00017,190,912
2Nov 7, 2024 20:14381,56357,295,834,70757,183,459,00050,970,00016,998,400
3Nov 7, 2024 20:14381,90657,345,399,68757,238,921,00046,972,00017,027,072
4Nov 7, 2024 20:14382,55357,440,595,85657,335,908,00046,972,00017,006,592
5Nov 7, 2024 20:14382,71757,466,756,75057,357,602,00049,971,00017,178,624
6Nov 7, 2024 20:14383,33257,572,453,33857,452,865,00046,969,00016,973,824
7Nov 7, 2024 20:14383,72957,619,744,13057,513,317,00045,970,00017,195,008
8Nov 7, 2024 20:14383,95057,657,676,21257,545,581,00046,971,00016,973,824
9Nov 7, 2024 20:14385,20457,846,213,41257,725,613,00054,964,00017,010,688