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 listMar 7, 2024 02:42Huy Duc LeHuy Duc LeScore: 3,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 02:422,945504,754,900441,709,423016,965,632
2Mar 7, 2024 02:422,946511,458,807441,826,255016,961,536
3Mar 7, 2024 02:422,953512,274,370442,912,194016,965,632
4Mar 7, 2024 02:423,001475,067,504420,120,00030,008,00016,986,112
5Mar 7, 2024 02:423,001474,712,640421,157,00029,010,00017,145,856
6Mar 7, 2024 02:423,002483,207,688422,404,00027,960,00017,035,264
7Mar 7, 2024 02:423,004479,192,719419,666,00030,975,00017,006,592
8Mar 7, 2024 02:423,005474,859,408422,713,00027,981,00017,031,168
9Mar 7, 2024 02:423,006478,199,491424,878,00025,992,00017,072,128
10Mar 7, 2024 02:423,007478,993,625424,987,00025,999,00017,178,624
11Mar 7, 2024 02:423,008473,620,854425,128,00026,007,00017,010,688
12Mar 7, 2024 02:423,017474,641,191427,577,00024,975,00017,027,072