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 13, 2026 22:34Aleksei ShahoikaAleksei ShahoikaScore: 3,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 22:353,407521,065,782501,992,0009,143,00016,793,600
2May 13, 2026 22:353,416522,095,553503,578,0008,865,00016,793,600
3May 13, 2026 22:353,421523,983,971504,379,0008,831,00016,793,600
4May 13, 2026 22:353,435525,873,257506,590,0008,806,00016,793,600
5May 13, 2026 22:353,436525,878,614506,452,0009,045,00016,793,600
6May 13, 2026 22:353,437524,838,304506,851,0008,801,00016,793,600
7May 13, 2026 22:353,437525,072,793506,569,0009,054,00016,793,600
8May 13, 2026 22:353,438524,604,464506,765,0009,058,00016,793,600
9May 13, 2026 22:353,442526,488,345507,245,0009,115,00016,793,600