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 listJun 24, 2026 10:12anboto1anboto1Score: 23,804Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:1322,3033,354,952,8653,325,789,00019,777,00016,793,600
2Jun 24, 2026 10:1322,7423,420,865,9633,391,475,00019,963,00016,793,600
3Jun 24, 2026 10:1323,3193,507,347,2563,476,568,00021,334,00016,793,600
4Jun 24, 2026 10:1323,5593,543,251,9453,512,957,00020,950,00016,793,600
5Jun 24, 2026 10:1323,8043,579,949,1473,549,890,00020,801,00016,793,600
6Jun 24, 2026 10:1323,8483,586,652,9523,556,651,00020,680,00016,793,600
7Jun 24, 2026 10:1326,6124,001,111,5223,970,542,00021,304,00016,793,600
8Jun 24, 2026 10:1326,8054,030,185,9053,999,511,00021,388,00016,793,600
9Jun 24, 2026 10:1326,9054,045,225,0404,014,382,00021,501,00016,793,600