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:48anboto1anboto1Score: 2,852Success
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:492,847437,198,485418,543,0008,593,00016,793,600
2Jul 29, 2026 18:492,850437,679,096418,933,0008,671,00016,793,600
3Jul 29, 2026 18:492,851437,648,896419,104,0008,612,00016,793,600
4Jul 29, 2026 18:492,851437,649,350419,045,0008,703,00016,793,600
5Jul 29, 2026 18:492,852437,853,048419,145,0008,714,00016,793,600
6Jul 29, 2026 18:492,852437,826,368419,182,0008,646,00016,793,600
7Jul 29, 2026 18:492,855438,177,477419,638,0008,697,00016,793,600
8Jul 29, 2026 18:492,856438,447,675419,755,0008,727,00016,793,600
9Jul 29, 2026 18:492,856438,477,393419,706,0008,756,00016,793,600