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 listAug 27, 2026 14:48Victor MerckléVictor MerckléScore: 2,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 14:532,290353,418,648335,586,0007,994,00016,801,792stderr
2Aug 27, 2026 14:532,299354,747,620336,943,0007,941,00016,801,792stderr
3Aug 27, 2026 14:532,299355,401,773336,864,0008,029,00016,801,792stderr
4Aug 27, 2026 14:532,299355,451,934336,846,0008,066,00016,801,792stderr
5Aug 27, 2026 14:532,301355,149,137337,309,0007,922,00016,801,792stderr
6Aug 27, 2026 14:532,303355,404,171337,576,0007,936,00016,801,792stderr
7Aug 27, 2026 14:532,315357,272,261339,389,0007,996,00016,801,792stderr
8Aug 27, 2026 14:532,316357,385,701339,389,0008,073,00016,801,792stderr
9Aug 27, 2026 14:532,336360,291,127342,457,0007,970,00016,801,792stderr