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 13:23Andrew EpsteinAndrew EpsteinScore: 26,934Success
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 13:2426,8014,030,535,1953,855,795,000164,379,00016,797,696stderr
2Sep 21, 2026 13:2426,8024,030,849,7003,856,563,000163,828,00016,801,792stderr
3Sep 21, 2026 13:2426,8174,033,189,6213,858,239,000164,425,00016,801,792stderr
4Sep 21, 2026 13:2426,8724,041,958,9453,865,336,000165,528,00016,801,792stderr
5Sep 21, 2026 13:2426,9344,052,023,7233,875,927,000164,213,00016,801,792stderr
6Sep 21, 2026 13:2426,9814,057,881,1423,883,027,000164,271,00016,801,792stderr
7Sep 21, 2026 13:2427,0394,067,428,4883,880,535,000175,416,00016,801,792stderr
8Sep 21, 2026 13:2427,2714,101,499,6533,919,131,000171,614,00016,801,792stderr
9Sep 21, 2026 13:2427,3804,118,280,8613,932,114,000174,911,00016,797,696stderr