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:29Huy Duc LeHuy Duc LeScore: 3,017Success
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:292,962503,880,160444,247,492016,965,632
2Mar 7, 2024 00:292,964527,106,373444,613,997016,957,440
3Mar 7, 2024 00:292,965497,610,898444,722,132016,961,536
4Mar 7, 2024 00:293,012478,885,649421,863,00029,990,00017,018,880
5Mar 7, 2024 00:293,014475,759,727416,087,00036,007,00017,031,168
6Mar 7, 2024 00:293,017476,181,965420,592,00031,969,00017,186,816
7Mar 7, 2024 00:293,017479,525,094413,605,00038,962,00017,145,856
8Mar 7, 2024 00:293,020473,430,805423,962,00028,997,00017,149,952
9Mar 7, 2024 00:293,023479,411,665419,500,00033,959,00016,949,248
10Mar 7, 2024 00:293,024481,079,773426,586,00026,973,00017,195,008
11Mar 7, 2024 00:293,024480,655,501421,616,00031,970,00017,096,704
12Mar 7, 2024 00:293,030486,016,433421,481,00032,959,00017,199,104