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 27, 2024 01:38Joad NacerJoad NacerScore: 4,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2024 01:384,221652,179,526595,148,00038,009,00016,977,920
2Dec 27, 2024 01:384,223672,461,657592,453,00040,962,00016,961,536
3Dec 27, 2024 01:384,224654,803,934590,639,00042,973,00017,047,552
4Dec 27, 2024 01:384,226658,441,463590,851,00042,989,00017,051,648
5Dec 27, 2024 01:384,226655,829,305593,851,00039,990,00017,096,704
6Dec 27, 2024 01:384,226659,258,627598,971,00034,998,00017,055,744
7Dec 27, 2024 01:384,229662,037,992594,357,00039,956,00017,215,488
8Dec 27, 2024 01:384,232658,059,408586,754,00047,979,00017,129,472
9Dec 27, 2024 01:384,234655,419,379597,131,00038,008,00017,051,648