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 listMay 22, 2024 18:24Joad NacerJoad NacerScore: 4,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 18:244,344722,905,252651,594,339016,855,040
2May 22, 2024 18:244,345710,128,672651,798,262016,859,136
3May 22, 2024 18:244,353717,604,262653,010,520016,855,040
4May 22, 2024 18:244,359678,894,276615,893,00037,993,00017,145,856
5May 22, 2024 18:244,361680,735,428609,151,00045,011,00016,969,728
6May 22, 2024 18:244,361678,679,278613,189,00041,012,00017,170,432
7May 22, 2024 18:244,362684,602,687611,223,00043,015,00017,149,952
8May 22, 2024 18:244,363685,157,445609,512,00044,964,00017,149,952
9May 22, 2024 18:244,364677,603,822609,657,00044,974,00017,162,240
10May 22, 2024 18:244,367681,178,354612,063,00043,004,00017,047,552
11May 22, 2024 18:244,369681,301,515614,280,00041,018,00017,158,144
12May 22, 2024 18:244,371691,272,835612,608,00042,972,00017,166,336