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:37Huy 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:372,961503,333,291444,094,010016,961,536
2Mar 7, 2024 00:372,968522,618,969445,257,632016,961,536
3Mar 7, 2024 00:372,980506,522,430446,942,862016,961,536
4Mar 7, 2024 00:373,014476,381,701421,147,00031,010,00017,022,976
5Mar 7, 2024 00:373,015482,096,280421,212,00031,015,00017,031,168
6Mar 7, 2024 00:373,017482,891,553422,510,00029,965,00017,035,264
7Mar 7, 2024 00:373,017476,777,562427,528,00024,972,00017,022,976
8Mar 7, 2024 00:373,018474,521,108424,754,00027,983,00017,043,456
9Mar 7, 2024 00:373,019484,061,285416,803,00035,982,00017,031,168
10Mar 7, 2024 00:373,023485,156,880428,482,00024,969,00017,006,592
11Mar 7, 2024 00:373,024477,994,822422,662,00030,975,00017,014,784
12Mar 7, 2024 00:373,033477,855,939424,993,00029,999,00017,199,104