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:19Andrew EpsteinAndrew EpsteinScore: 25,858Success
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:2025,8363,886,567,8043,802,682,00072,813,00016,797,696stderr
2Sep 21, 2026 14:2025,8533,888,965,7483,805,453,00072,535,00016,797,696stderr
3Sep 21, 2026 14:2025,8533,889,203,8893,804,946,00073,080,00016,801,792stderr
4Sep 21, 2026 14:2025,8533,888,411,3273,806,137,00071,835,00016,797,696stderr
5Sep 21, 2026 14:2025,8583,889,768,8553,806,947,00071,888,00016,801,792stderr
6Sep 21, 2026 14:2025,8763,893,503,0903,807,650,00073,753,00016,801,792stderr
7Sep 21, 2026 14:2025,9113,897,184,8863,814,271,00072,512,00016,801,792stderr
8Sep 21, 2026 14:2025,9323,900,312,1533,817,107,00072,696,00016,797,696stderr
9Sep 21, 2026 14:2025,9413,901,584,8213,818,532,00072,681,00016,801,792stderr