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 listSep 4, 2026 09:22Victor MerckléVictor MerckléScore: 1,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 09:261,581249,726,766233,146,0004,153,00016,801,792stderr
2Sep 4, 2026 09:261,581245,916,494233,111,0004,186,00016,801,792stderr
3Sep 4, 2026 09:261,584246,138,679233,344,0004,256,00016,801,792stderr
4Sep 4, 2026 09:261,584246,213,771233,562,0004,162,00016,801,792stderr
5Sep 4, 2026 09:261,585246,383,405233,578,0004,220,00016,801,792stderr
6Sep 4, 2026 09:261,586246,601,752233,846,0004,177,00016,801,792stderr
7Sep 4, 2026 09:261,587246,608,873233,980,0004,156,00016,801,792stderr
8Sep 4, 2026 09:261,587246,615,839233,860,0004,232,00016,801,792stderr
9Sep 4, 2026 09:261,589246,932,686234,175,0004,224,00016,801,792stderr