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 15:56anboto1anboto1Score: 5,351Success
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 15:575,196789,458,295772,449,0006,975,00016,793,600
2Jul 29, 2026 15:575,204790,565,490773,612,0006,998,00016,793,600
3Jul 29, 2026 15:575,308806,181,881789,236,0006,978,00016,793,600
4Jul 29, 2026 15:575,324810,021,188791,409,0007,330,00016,793,600
5Jul 29, 2026 15:575,351814,004,119795,619,0007,061,00016,793,600
6Jul 29, 2026 15:575,354813,214,045795,294,0007,821,00016,793,600
7Jul 29, 2026 15:575,375816,122,594799,220,0007,031,00016,793,600
8Jul 29, 2026 15:575,454828,220,811811,174,0007,022,00016,793,600
9Jul 29, 2026 15:575,467830,225,593812,824,0007,355,00016,793,600