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:39Andrew EpsteinAndrew EpsteinScore: 28,979Success
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:4028,8764,341,962,8134,028,784,000302,739,00016,801,792stderr
2Sep 21, 2026 13:4028,8884,344,987,2074,030,785,000302,423,00016,797,696stderr
3Sep 21, 2026 13:4028,8974,345,490,6814,032,615,000301,942,00016,797,696stderr
4Sep 21, 2026 13:4028,9104,346,987,4114,034,466,000302,056,00016,797,696stderr
5Sep 21, 2026 13:4028,9794,358,598,1444,032,554,000314,428,00016,797,696stderr
6Sep 21, 2026 13:4028,9914,359,660,0704,036,748,000312,019,00016,797,696stderr
7Sep 21, 2026 13:4028,9964,360,296,7604,042,884,000306,652,00016,801,792stderr
8Sep 21, 2026 13:4029,0424,367,566,7624,053,110,000303,320,00016,801,792stderr
9Sep 21, 2026 13:4029,0454,367,268,9104,054,103,000302,678,00016,797,696stderr