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 6, 2024 16:11Huy Duc LeHuy Duc LeScore: 5,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 16:113,094536,644,563464,072,036016,945,152
2Mar 6, 2024 16:113,101529,537,862465,076,615016,957,440
3Mar 6, 2024 16:113,128525,756,657469,234,296016,953,344
4Mar 6, 2024 16:115,016777,064,248726,444,00025,980,00017,121,280
5Mar 6, 2024 16:115,024778,356,742725,545,00027,982,00017,018,880
6Mar 6, 2024 16:115,024782,382,757724,560,00028,982,00017,010,688
7Mar 6, 2024 16:115,026780,686,005713,875,00039,993,00017,162,240
8Mar 6, 2024 16:115,029782,763,870714,419,00039,967,00017,190,912
9Mar 6, 2024 16:115,031778,174,507727,654,00026,987,00017,002,496
10Mar 6, 2024 16:115,037782,639,963724,564,00030,981,00017,104,896
11Mar 6, 2024 16:115,051784,749,627726,696,00030,987,00017,199,104
12Mar 6, 2024 16:115,490849,995,004787,535,00035,978,00017,174,528