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 20:31anboto1anboto1Score: 3,453Success
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 20:323,434525,228,598489,150,00026,098,00016,793,600
2Jul 29, 2026 20:323,438525,847,294490,079,00025,770,00016,793,600
3Jul 29, 2026 20:323,439525,953,579490,036,00025,954,00016,793,600
4Jul 29, 2026 20:323,444526,675,580490,310,00026,291,00016,793,600
5Jul 29, 2026 20:323,453528,195,388492,102,00025,974,00016,793,600
6Jul 29, 2026 20:323,454528,297,698491,481,00026,758,00016,793,600
7Jul 29, 2026 20:323,467530,143,512493,407,00026,713,00016,793,600
8Jul 29, 2026 20:323,469530,379,945493,612,00026,785,00016,793,600
9Jul 29, 2026 20:323,503535,394,325499,293,00026,240,00016,793,600