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 listMay 14, 2026 00:41Aleksei ShahoikaAleksei ShahoikaScore: 2,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 00:412,257350,209,368332,695,0005,857,00016,797,696
2May 14, 2026 00:412,261348,228,733333,024,0006,126,00016,797,696
3May 14, 2026 00:412,266350,601,886333,782,0006,125,00016,797,696
4May 14, 2026 00:412,268351,972,176334,198,0006,130,00016,797,696
5May 14, 2026 00:412,269349,943,868334,142,0006,228,00016,797,696
6May 14, 2026 00:412,270352,164,952334,446,0006,182,00016,797,696
7May 14, 2026 00:412,270349,404,707334,492,0006,110,00016,797,696
8May 14, 2026 00:412,272352,687,072334,736,0006,071,00016,797,696
9May 14, 2026 00:412,273350,527,520334,861,0006,168,00016,797,696