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 17, 2026 14:09Victor MerckléVictor MerckléScore: 1,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 14:101,725268,008,678251,016,0007,758,00016,797,696
2Jun 17, 2026 14:101,725268,718,203251,066,0007,730,00016,797,696
3Jun 17, 2026 14:101,725268,196,550251,064,0007,698,00016,797,696
4Jun 17, 2026 14:101,726268,518,666251,366,0007,679,00016,797,696
5Jun 17, 2026 14:101,726268,604,600251,298,0007,749,00016,797,696
6Jun 17, 2026 14:101,726268,503,661251,316,0007,719,00016,797,696
7Jun 17, 2026 14:101,728269,123,966251,617,0007,725,00016,797,696
8Jun 17, 2026 14:101,730269,385,501251,846,0007,761,00016,797,696
9Jun 17, 2026 14:101,731268,870,971251,944,0007,715,00016,797,696