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 30, 2026 22:20Victor MerckléVictor MerckléScore: 1,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 22:221,580247,158,815232,903,0004,191,00016,797,696stderr
2Aug 30, 2026 22:221,582247,323,720233,069,0004,280,00016,797,696stderr
3Aug 30, 2026 22:221,582247,395,386233,119,0004,258,00016,797,696stderr
4Aug 30, 2026 22:221,582247,318,573233,153,0004,266,00016,797,696stderr
5Aug 30, 2026 22:221,582247,323,300233,162,0004,257,00016,797,696stderr
6Aug 30, 2026 22:221,583247,485,673233,274,0004,261,00016,797,696stderr
7Aug 30, 2026 22:221,583247,425,867233,219,0004,255,00016,797,696stderr
8Aug 30, 2026 22:221,585248,005,508233,419,0004,333,00016,797,696stderr
9Aug 30, 2026 22:221,585247,678,982233,441,0004,317,00016,797,696stderr