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 00:45Huy Duc LeHuy Duc LeScore: 3,021Success
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 00:452,972509,858,641445,814,776016,961,536
2Mar 7, 2024 00:452,972503,015,526445,834,724016,961,536
3Mar 7, 2024 00:452,973508,081,484445,878,869016,969,728
4Mar 7, 2024 00:453,018479,353,300426,659,00025,979,00017,121,280
5Mar 7, 2024 00:453,019481,106,719422,820,00029,987,00017,158,144
6Mar 7, 2024 00:453,019478,493,006424,840,00027,989,00017,195,008
7Mar 7, 2024 00:453,021481,162,897427,096,00026,005,00017,014,784
8Mar 7, 2024 00:453,023480,414,346427,517,00025,970,00017,014,784
9Mar 7, 2024 00:453,024476,316,858420,589,00032,967,00017,141,760
10Mar 7, 2024 00:453,027477,513,311429,990,00023,999,00017,059,840
11Mar 7, 2024 00:453,028483,468,509427,120,00027,007,00017,031,168
12Mar 7, 2024 00:453,031479,020,458427,683,00026,980,00017,063,936