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 15:05Andrew EpsteinAndrew EpsteinScore: 25,270Success
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 15:0725,2653,801,151,6553,722,556,00067,262,00016,801,792stderr
2Sep 21, 2026 15:0725,2663,800,980,8603,723,988,00066,025,00016,801,792stderr
3Sep 21, 2026 15:0725,2663,800,595,6753,723,049,00066,963,00016,801,792stderr
4Sep 21, 2026 15:0725,2673,801,170,2113,724,286,00065,871,00016,801,792stderr
5Sep 21, 2026 15:0725,2703,801,621,2623,724,393,00066,194,00016,801,792stderr
6Sep 21, 2026 15:0725,2723,801,442,0713,724,315,00066,607,00016,801,792stderr
7Sep 21, 2026 15:0725,3073,806,492,0153,729,632,00066,483,00016,801,792stderr
8Sep 21, 2026 15:0725,3123,807,341,0523,730,482,00066,431,00016,801,792stderr
9Sep 21, 2026 15:0725,3163,808,517,5183,730,945,00066,525,00016,801,792stderr