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 19, 2024 04:13Huy Duc LeHuy Duc LeScore: 2,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2024 04:132,966506,391,943444,954,556016,965,632
2Mar 19, 2024 04:132,970507,629,918445,480,083016,961,536
3Mar 19, 2024 04:132,972497,243,860445,860,914016,965,632
4Mar 19, 2024 04:132,995470,285,408420,190,00029,013,00017,113,088
5Mar 19, 2024 04:132,997485,689,796417,522,00031,963,00017,035,264
6Mar 19, 2024 04:132,997473,648,684417,576,00031,967,00017,010,688
7Mar 19, 2024 04:132,997472,995,273420,587,00028,971,00017,018,880
8Mar 19, 2024 04:132,998473,621,682415,778,00033,981,00017,010,688
9Mar 19, 2024 04:132,999477,581,076418,792,00030,984,00017,121,280
10Mar 19, 2024 04:133,002480,641,859424,298,00026,018,00017,059,840
11Mar 19, 2024 04:133,004474,745,072409,686,00040,968,00017,018,880
12Mar 19, 2024 04:133,013474,272,190422,932,00028,995,00017,010,688