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 10:25Victor MerckléVictor MerckléScore: 1,624Success
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 10:261,621253,255,061235,352,0007,911,00016,801,792stderr
2Aug 27, 2026 10:261,622253,309,053235,486,0007,893,00016,801,792stderr
3Aug 27, 2026 10:261,622254,007,225235,383,0008,009,00016,801,792stderr
4Aug 27, 2026 10:261,622253,189,985235,435,0007,876,00016,801,792stderr
5Aug 27, 2026 10:261,624253,518,622235,552,0008,064,00016,801,792stderr
6Aug 27, 2026 10:261,624253,492,421235,554,0008,085,00016,801,792stderr
7Aug 27, 2026 10:261,625253,703,809235,908,0007,951,00016,801,792stderr
8Aug 27, 2026 10:261,626253,774,646235,879,0008,023,00016,801,792stderr
9Aug 27, 2026 10:261,626254,514,469236,043,0007,979,00016,801,792stderr