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:04Andrew EpsteinAndrew EpsteinScore: 23,484Success
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:0523,4553,529,623,9123,425,911,00092,429,00016,801,792stderr
2Sep 21, 2026 14:0523,4553,528,640,8073,426,209,00092,066,00016,797,696stderr
3Sep 21, 2026 14:0523,4703,531,194,0133,428,792,00091,775,00016,797,696stderr
4Sep 21, 2026 14:0523,4733,532,741,2363,428,488,00092,566,00016,797,696stderr
5Sep 21, 2026 14:0523,4843,533,101,7883,430,889,00091,837,00016,801,792stderr
6Sep 21, 2026 14:0523,4863,534,144,9673,431,067,00091,943,00016,797,696stderr
7Sep 21, 2026 14:0523,5303,540,016,9703,437,262,00092,360,00016,801,792stderr
8Sep 21, 2026 14:0523,5573,545,093,5903,441,265,00092,433,00016,801,792stderr
9Sep 21, 2026 14:0523,5743,547,244,3773,443,363,00092,851,00016,797,696stderr