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:53Andrew EpsteinAndrew EpsteinScore: 23,705Success
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:5423,6793,562,437,2583,465,633,00086,272,00016,797,696stderr
2Sep 21, 2026 13:5423,6803,563,174,5853,466,309,00085,826,00016,801,792stderr
3Sep 21, 2026 13:5423,6903,565,195,7193,464,739,00088,833,00016,797,696stderr
4Sep 21, 2026 13:5423,6993,565,281,8573,469,597,00085,281,00016,801,792stderr
5Sep 21, 2026 13:5423,7053,566,258,5293,469,809,00086,085,00016,797,696stderr
6Sep 21, 2026 13:5423,7113,567,561,7453,469,846,00086,921,00016,801,792stderr
7Sep 21, 2026 13:5423,7413,571,593,6473,474,950,00086,214,00016,797,696stderr
8Sep 21, 2026 13:5423,7433,574,171,7843,474,711,00086,764,00016,797,696stderr
9Sep 21, 2026 13:5423,7573,574,612,4993,477,394,00086,237,00016,801,792stderr