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 listJul 29, 2026 16:38anboto1anboto1Score: 3,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 16:393,515537,562,140518,643,0008,694,00016,793,600
2Jul 29, 2026 16:393,516537,492,119518,458,0008,968,00016,793,600
3Jul 29, 2026 16:393,517537,726,423518,996,0008,655,00016,793,600
4Jul 29, 2026 16:393,520538,169,883519,389,0008,707,00016,793,600
5Jul 29, 2026 16:393,521538,181,479519,578,0008,659,00016,793,600
6Jul 29, 2026 16:393,526539,060,338520,306,0008,680,00016,793,600
7Jul 29, 2026 16:393,529539,556,011520,777,0008,701,00016,793,600
8Jul 29, 2026 16:393,529539,457,249520,768,0008,685,00016,793,600
9Jul 29, 2026 16:393,530539,557,642520,891,0008,660,00016,793,600