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 18:03anboto1anboto1Score: 2,746Success
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 18:032,742421,365,727396,963,00014,411,00016,793,600
2Jul 29, 2026 18:032,744422,446,444397,130,00014,502,00016,793,600
3Jul 29, 2026 18:032,745421,752,362397,331,00014,529,00016,793,600
4Jul 29, 2026 18:032,746422,007,268397,454,00014,505,00016,793,600
5Jul 29, 2026 18:032,746422,743,202397,279,00014,663,00016,793,600
6Jul 29, 2026 18:032,747423,271,339397,483,00014,571,00016,793,600
7Jul 29, 2026 18:032,748422,429,695397,712,00014,598,00016,793,600
8Jul 29, 2026 18:032,749423,814,117397,712,00014,743,00016,793,600
9Jul 29, 2026 18:032,750422,554,428398,034,00014,580,00016,793,600