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 22:42gchebanovgchebanovScore: 4,157Success
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 22:424,083668,426,441612,489,151016,953,344
2Jul 12, 2023 22:424,099682,446,871614,906,453016,961,536
3Jul 12, 2023 22:424,113676,748,136616,992,634016,961,536
4Jul 12, 2023 22:424,147642,856,529593,995,00027,999,00017,027,072
5Jul 12, 2023 22:424,150652,549,443597,465,00024,977,00016,965,632
6Jul 12, 2023 22:424,154649,925,480600,134,00023,005,00017,207,296
7Jul 12, 2023 22:424,157650,921,247597,568,00025,981,00016,953,344
8Jul 12, 2023 22:424,158647,963,839595,692,00027,985,00017,190,912
9Jul 12, 2023 22:424,159649,088,021595,831,00027,992,00016,977,920
10Jul 12, 2023 22:424,161648,535,681600,115,00024,004,00017,170,432
11Jul 12, 2023 22:424,161650,737,031596,128,00028,006,00017,055,744
12Jul 12, 2023 22:424,163649,084,218596,482,00027,975,00016,969,728