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 listNov 4, 2026 00:25Andrew EpsteinAndrew EpsteinScore: 18,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 00:2618,9782,856,813,5472,796,688,00050,160,00016,805,888stderr
2Nov 4, 2026 00:2618,9832,857,476,5802,797,290,00050,296,00016,805,888stderr
3Nov 4, 2026 00:2618,9832,856,956,6792,797,306,00050,233,00016,805,888stderr
4Nov 4, 2026 00:2618,9862,857,458,7022,798,233,00049,779,00016,805,888stderr
5Nov 4, 2026 00:2618,9902,858,552,0302,797,643,00050,864,00016,801,792stderr
6Nov 4, 2026 00:2618,9942,858,614,8192,798,698,00050,431,00016,805,888stderr
7Nov 4, 2026 00:2619,0242,863,240,8812,802,912,00050,795,00016,805,888stderr
8Nov 4, 2026 00:2619,0352,865,109,3832,804,521,00050,743,00016,805,888stderr
9Nov 4, 2026 00:2619,0352,864,720,6652,804,558,00050,774,00016,805,888stderr