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 listJul 12, 2023 21:47gchebanovgchebanovScore: 4,288Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 21:474,270701,014,406640,465,660016,891,904
2Jul 12, 2023 21:474,274701,745,363641,057,379016,896,000
3Jul 12, 2023 21:474,280663,855,142616,028,00026,001,00017,186,816
4Jul 12, 2023 21:474,280664,999,098618,049,00024,001,00017,043,456
5Jul 12, 2023 21:474,281667,504,568616,097,00026,004,00017,039,360
6Jul 12, 2023 21:474,287668,373,981616,059,00027,002,00017,039,360
7Jul 12, 2023 21:474,288728,972,975643,231,327016,896,000
8Jul 12, 2023 21:474,294675,234,861610,094,00034,005,00017,043,456
9Jul 12, 2023 21:474,297668,174,778617,638,00026,984,00017,035,264
10Jul 12, 2023 21:474,301671,698,280619,098,00026,004,00016,998,400
11Jul 12, 2023 21:474,301669,152,798621,144,00024,005,00016,986,112
12Jul 12, 2023 21:474,302675,959,008616,264,00029,012,00017,047,552