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 listSep 21, 2026 16:39Andrew EpsteinAndrew EpsteinScore: 1,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 16:391,612251,227,374237,530,0004,367,00016,793,600
2Sep 21, 2026 16:391,613251,362,978237,659,0004,332,00016,793,600
3Sep 21, 2026 16:391,613252,490,434237,652,0004,381,00016,793,600
4Sep 21, 2026 16:391,613250,728,336237,668,0004,348,00016,793,600
5Sep 21, 2026 16:391,613252,374,957237,899,0004,198,00016,793,600
6Sep 21, 2026 16:391,613250,798,334237,831,0004,195,00016,793,600
7Sep 21, 2026 16:391,617252,278,239238,428,0004,266,00016,793,600
8Sep 21, 2026 16:391,617252,093,078238,369,0004,315,00016,793,600
9Sep 21, 2026 16:391,617251,490,460238,438,0004,246,00016,793,600