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 19, 2026 17:44Victor MerckléVictor MerckléScore: 1,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 17:521,623253,345,957235,659,0007,814,00016,801,792stderr
2Aug 19, 2026 17:521,624253,602,545235,798,0007,934,00016,801,792stderr
3Aug 19, 2026 17:521,624253,536,173235,763,0007,894,00016,801,792stderr
4Aug 19, 2026 17:521,625253,636,636235,872,0007,879,00016,801,792stderr
5Aug 19, 2026 17:521,625253,597,359235,890,0007,873,00016,801,792stderr
6Aug 19, 2026 17:521,626253,890,734235,879,0008,042,00016,801,792stderr
7Aug 19, 2026 17:521,628254,278,403236,276,0008,017,00016,801,792stderr
8Aug 19, 2026 17:521,628254,215,163236,317,0008,030,00016,801,792stderr
9Aug 19, 2026 17:521,629254,205,021236,349,0008,005,00016,801,792stderr