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:19anboto1anboto1Score: 19,788Success
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:2012,4201,873,368,3281,835,957,00027,119,00016,793,600
2Jul 29, 2026 20:2012,8021,930,368,3571,893,847,00026,564,00016,793,600
3Jul 29, 2026 20:2012,8081,931,248,0611,894,184,00027,060,00016,793,600
4Jul 29, 2026 20:2012,8101,931,847,6801,894,375,00027,262,00016,793,600
5Jul 29, 2026 20:2019,7882,978,376,4802,941,796,00026,459,00016,793,600
6Jul 29, 2026 20:2020,4513,077,733,8433,041,702,00025,978,00016,793,600
7Jul 29, 2026 20:2020,5073,086,397,3243,048,706,00027,423,00016,793,600
8Jul 29, 2026 20:2020,5113,086,836,7623,051,142,00025,642,00016,793,600
9Jul 29, 2026 20:2020,7453,121,950,0233,085,686,00026,075,00016,793,600