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 3, 2026 05:02Victor MerckléVictor MerckléScore: 1,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 05:031,648257,199,031239,448,0007,884,00016,801,792stderr
2Aug 3, 2026 05:031,649257,446,388239,592,0007,896,00016,801,792stderr
3Aug 3, 2026 05:031,650257,491,633239,620,0007,922,00016,801,792stderr
4Aug 3, 2026 05:031,651257,592,668239,734,0007,925,00016,801,792stderr
5Aug 3, 2026 05:031,651257,590,250239,803,0007,931,00016,801,792stderr
6Aug 3, 2026 05:031,653257,923,846239,978,0008,055,00016,801,792stderr
7Aug 3, 2026 05:031,656258,457,917240,507,0007,996,00016,801,792stderr
8Aug 3, 2026 05:031,656258,398,731240,519,0007,985,00016,801,792stderr
9Aug 3, 2026 05:031,656258,238,994240,491,0007,932,00016,801,792stderr