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:32Huy Duc LeHuy Duc LeScore: 3,009Success
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:322,953516,610,599443,024,741016,961,536
2Mar 7, 2024 02:322,956509,710,337443,425,017016,969,728
3Mar 7, 2024 02:322,966506,902,566444,848,294016,965,632
4Mar 7, 2024 02:323,007479,953,918421,006,00030,000,00017,010,688
5Mar 7, 2024 02:323,007476,739,719424,026,00027,001,00017,010,688
6Mar 7, 2024 02:323,008474,016,926416,191,00035,016,00017,113,088
7Mar 7, 2024 02:323,009476,319,317419,432,00031,956,00017,133,568
8Mar 7, 2024 02:323,012476,352,048422,879,00028,991,00017,014,784
9Mar 7, 2024 02:323,013480,914,749428,011,00024,000,00017,022,976
10Mar 7, 2024 02:323,016480,352,249424,396,00027,960,00017,133,568
11Mar 7, 2024 02:323,018480,695,446418,722,00033,977,00017,022,976
12Mar 7, 2024 02:323,022481,402,125420,268,00033,021,00017,100,800