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 14:38Andrew EpsteinAndrew EpsteinScore: 14,452Success
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 14:3914,4302,174,956,0512,124,787,00039,808,00016,801,792stderr
2Sep 21, 2026 14:3914,4432,177,242,4662,125,630,00040,891,00016,801,792stderr
3Sep 21, 2026 14:3914,4432,177,447,2142,127,237,00039,270,00016,801,792stderr
4Sep 21, 2026 14:3914,4472,177,669,0242,125,996,00041,191,00016,797,696stderr
5Sep 21, 2026 14:3914,4522,178,314,1882,127,494,00040,363,00016,801,792stderr
6Sep 21, 2026 14:3914,4522,178,949,6932,127,630,00040,212,00016,797,696stderr
7Sep 21, 2026 14:3914,4642,180,348,0792,129,516,00040,228,00016,801,792stderr
8Sep 21, 2026 14:3914,4772,182,617,6182,131,341,00040,310,00016,797,696stderr
9Sep 21, 2026 14:3914,4782,182,159,1772,131,497,00040,327,00016,797,696stderr