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 30, 2026 00:09anboto1anboto1Score: 3,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:153,263499,590,604475,080,00014,477,00016,797,696
2Jul 30, 2026 00:153,264499,747,987475,140,00014,539,00016,797,696
3Jul 30, 2026 00:153,267500,092,652475,467,00014,659,00016,797,696
4Jul 30, 2026 00:153,267500,264,591475,375,00014,778,00016,797,696
5Jul 30, 2026 00:153,268501,780,193475,710,00014,530,00016,797,696
6Jul 30, 2026 00:153,268500,356,358475,630,00014,581,00016,797,696
7Jul 30, 2026 00:153,271500,687,200476,143,00014,604,00016,797,696
8Jul 30, 2026 00:153,272500,844,448476,422,00014,498,00016,797,696
9Jul 30, 2026 00:153,277501,528,060476,954,00014,627,00016,797,696