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 03:09Huy Duc LeHuy Duc LeScore: 3,001Success
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 03:092,947499,861,947442,039,031016,961,536
2Mar 7, 2024 03:092,948500,536,392442,241,147016,961,536
3Mar 7, 2024 03:092,954500,889,704443,039,585016,953,344
4Mar 7, 2024 03:092,994476,387,437419,149,00030,010,00017,027,072
5Mar 7, 2024 03:092,997472,650,595416,651,00032,972,00017,125,376
6Mar 7, 2024 03:093,000472,857,581413,935,00035,994,00017,133,568
7Mar 7, 2024 03:093,001484,786,208423,113,00027,007,00017,018,880
8Mar 7, 2024 03:093,004476,090,068420,583,00029,970,00017,027,072
9Mar 7, 2024 03:093,005481,745,082413,811,00036,983,00016,957,440
10Mar 7, 2024 03:093,006476,345,357418,869,00031,990,00017,108,992
11Mar 7, 2024 03:093,009484,693,263417,375,00033,949,00017,027,072
12Mar 7, 2024 03:093,009483,218,670419,448,00031,957,00017,027,072