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 21, 2023 04:04Yuriy LyfenkoYuriy LyfenkoScore: 11,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 20, 2023 23:077,2961,164,325,1991,094,474,657016,953,344
2Mar 20, 2023 23:077,3281,156,235,8591,099,217,535016,957,440
3Mar 20, 2023 23:077,3421,168,671,2541,101,309,818016,949,248
4Mar 21, 2023 04:0411,0091,721,464,2571,651,278,350016,949,248
5Mar 21, 2023 04:0411,1791,740,101,0351,676,818,805016,957,440
6Mar 21, 2023 04:0411,1831,743,899,0701,677,409,582016,953,344