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 12, 2026 05:46Victor MerckléVictor MerckléScore: 1,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 05:471,710266,065,278248,875,0007,700,00016,797,696
2Jun 12, 2026 05:471,711265,850,368248,875,0007,851,00016,797,696
3Jun 12, 2026 05:471,711267,313,110249,032,0007,667,00016,797,696
4Jun 12, 2026 05:471,711265,891,448248,956,0007,797,00016,797,696
5Jun 12, 2026 05:471,712265,943,761249,082,0007,742,00016,797,696
6Jun 12, 2026 05:471,714266,335,769249,418,0007,753,00016,797,696
7Jun 12, 2026 05:471,716266,604,455249,723,0007,790,00016,797,696
8Jun 12, 2026 05:471,716266,627,332249,750,0007,735,00016,797,696
9Jun 12, 2026 05:471,718266,742,934249,844,0007,857,00016,797,696