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:20Huy 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:202,949514,089,176442,411,079016,965,632
2Mar 7, 2024 02:202,953504,913,642442,967,210016,949,248
3Mar 7, 2024 02:202,960509,231,506444,021,312016,957,440
4Mar 7, 2024 02:203,001476,692,418422,126,00028,008,00017,031,168
5Mar 7, 2024 02:203,004478,889,504419,690,00030,977,00017,113,088
6Mar 7, 2024 02:203,005476,916,633419,764,00030,982,00017,170,432
7Mar 7, 2024 02:203,006473,317,413419,946,00030,996,00017,158,144
8Mar 7, 2024 02:203,010476,621,652418,602,00032,968,00017,014,784
9Mar 7, 2024 02:203,014478,097,802421,161,00031,011,00017,137,664
10Mar 7, 2024 02:203,016478,436,216419,457,00032,957,00017,117,184
11Mar 7, 2024 02:203,017474,049,241423,636,00028,975,00017,129,472
12Mar 7, 2024 02:203,022487,933,728421,276,00032,020,00017,010,688