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:40Huy Duc LeHuy Duc LeScore: 3,006Success
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:402,948504,380,434442,163,895016,957,440
2Mar 7, 2024 02:402,948511,035,821442,178,239016,965,632
3Mar 7, 2024 02:402,957506,534,319443,481,406016,965,632
4Mar 7, 2024 02:402,997475,218,306421,530,00027,968,00017,022,976
5Mar 7, 2024 02:402,999476,212,892421,898,00027,993,00017,022,976
6Mar 7, 2024 02:403,000471,639,517420,940,00028,995,00016,990,208
7Mar 7, 2024 02:403,006479,361,630419,843,00030,988,00017,182,720
8Mar 7, 2024 02:403,006474,740,303424,859,00025,991,00017,010,688
9Mar 7, 2024 02:403,007482,832,072415,002,00036,000,00017,190,912
10Mar 7, 2024 02:403,007478,307,641409,024,00042,002,00017,158,144
11Mar 7, 2024 02:403,009476,967,299420,375,00030,953,00017,018,880
12Mar 7, 2024 02:403,009479,126,756424,390,00026,961,00017,162,240