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:54Andrew EpsteinAndrew EpsteinScore: 13,696Success
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:5513,6942,064,565,1922,012,206,00041,911,00016,801,792stderr
2Sep 21, 2026 14:5513,6952,064,729,6732,013,543,00040,814,00016,801,792stderr
3Sep 21, 2026 14:5513,6962,064,830,0832,012,685,00041,747,00016,801,792stderr
4Sep 21, 2026 14:5513,6962,064,956,0132,012,373,00042,128,00016,801,792stderr
5Sep 21, 2026 14:5513,6962,066,390,1822,012,708,00041,716,00016,801,792stderr
6Sep 21, 2026 14:5513,7022,065,987,3502,012,658,00042,661,00016,801,792stderr
7Sep 21, 2026 14:5513,7202,068,373,1462,016,405,00041,638,00016,801,792stderr
8Sep 21, 2026 14:5513,7222,068,648,8652,016,388,00041,919,00016,801,792stderr
9Sep 21, 2026 14:5513,7222,069,388,8092,017,132,00041,220,00016,801,792stderr