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 20:17gchebanovgchebanovScore: 4,065Success
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 20:174,043665,707,536606,452,176016,949,248
2Jul 12, 2023 20:174,048672,890,704607,129,388016,945,152
3Jul 12, 2023 20:174,049683,024,136607,318,613016,949,248
4Jul 12, 2023 20:174,062635,429,911583,380,00025,972,00017,080,320
5Jul 12, 2023 20:174,062640,229,018586,387,00022,976,00017,022,976
6Jul 12, 2023 20:174,064631,586,936586,678,00022,987,00016,965,632
7Jul 12, 2023 20:174,065635,982,227583,710,00025,987,00016,965,632
8Jul 12, 2023 20:174,066636,668,946586,883,00022,995,00016,977,920
9Jul 12, 2023 20:174,070640,715,998582,497,00027,975,00017,108,992
10Jul 12, 2023 20:174,071633,508,026584,657,00025,984,00017,047,552
11Jul 12, 2023 20:174,073639,601,256584,933,00025,997,00016,969,728
12Jul 12, 2023 20:174,074639,832,947585,067,00026,002,00016,961,536