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 listJun 19, 2026 04:36Victor MerckléVictor MerckléScore: 1,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 04:371,652257,108,541239,977,0007,925,00016,797,696
2Jun 19, 2026 04:371,652257,010,697240,007,0007,868,00016,797,696
3Jun 19, 2026 04:371,653257,100,554240,108,0007,860,00016,797,696
4Jun 19, 2026 04:371,655257,369,029240,350,0007,928,00016,797,696
5Jun 19, 2026 04:371,655257,462,476240,203,0008,098,00016,797,696
6Jun 19, 2026 04:371,655257,351,543240,294,0007,976,00016,797,696
7Jun 19, 2026 04:371,657257,825,209240,801,0007,892,00016,797,696
8Jun 19, 2026 04:371,659257,920,668240,933,0007,941,00016,797,696
9Jun 19, 2026 04:371,661258,370,809241,222,0008,009,00016,797,696