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 listMar 4, 2026 20:33olliecrowolliecrowScore: 3,718Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:333,710581,048,113526,552,00029,974,00016,977,920
2Mar 4, 2026 20:333,712585,009,283523,800,00032,987,00017,051,648
3Mar 4, 2026 20:333,712585,893,656526,829,00029,990,00016,973,824
4Mar 4, 2026 20:333,716575,683,606524,420,00032,963,00016,973,824
5Mar 4, 2026 20:333,718586,438,103526,780,00030,987,00017,145,856
6Mar 4, 2026 20:333,719588,085,407528,806,00028,989,00016,965,632
7Mar 4, 2026 20:333,719581,954,772528,826,00028,990,00017,084,416
8Mar 4, 2026 20:333,719587,453,976522,918,00034,994,00016,969,728
9Mar 4, 2026 20:333,722589,994,019527,370,00030,963,00017,121,280