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 28, 2024 01:15Joad NacerJoad NacerScore: 4,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 01:154,188650,639,069584,143,00044,010,00017,051,648
2Dec 28, 2024 01:154,189655,964,306584,334,00044,025,00017,047,552
3Dec 28, 2024 01:154,190654,795,923578,560,00049,962,00017,137,664
4Dec 28, 2024 01:154,190649,941,376584,603,00043,970,00017,047,552
5Dec 28, 2024 01:154,191649,984,989582,624,00045,970,00017,051,648
6Dec 28, 2024 01:154,193651,990,020584,918,00043,993,00017,047,552
7Dec 28, 2024 01:154,194652,256,441582,037,00047,003,00017,027,072
8Dec 28, 2024 01:154,194654,970,677584,110,00045,008,00017,182,720
9Dec 28, 2024 01:154,195661,756,002586,234,00043,017,00017,141,760