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 1, 2025 17:00DanielDanielScore: 5,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2025 17:005,426847,066,816799,958,00013,981,00016,961,536
2Mar 1, 2025 17:005,436841,917,433802,372,00012,989,00016,957,440
3Mar 1, 2025 17:005,445846,327,127804,729,00011,981,00016,949,248
4Mar 1, 2025 17:005,451845,130,589806,647,00010,981,00016,953,344
5Mar 1, 2025 17:005,468850,495,617806,231,00013,986,00016,957,440
6Mar 1, 2025 17:005,486856,394,068811,872,00010,984,00016,965,632
7Mar 1, 2025 17:005,500855,934,647810,072,00014,982,00016,957,440
8Mar 1, 2025 17:005,565863,870,070824,736,0009,984,00017,145,856
9Mar 1, 2025 17:006,392983,476,801944,772,00013,981,00017,084,416