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 10, 2026 21:10izotoffizotoffScore: 4,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:104,320674,626,281624,091,00023,965,00016,949,248
2Mar 10, 2026 21:104,326679,942,928621,906,00026,952,00017,104,896
3Mar 10, 2026 21:104,326672,103,326618,937,00029,948,00016,953,344
4Mar 10, 2026 21:104,329673,476,649624,379,00024,975,00016,977,920
5Mar 10, 2026 21:104,331680,748,717625,751,00023,952,00016,949,248
6Mar 10, 2026 21:104,334674,289,230624,198,00025,966,00016,949,248
7Mar 10, 2026 21:104,340679,384,081627,005,00023,961,00016,949,248
8Mar 10, 2026 21:104,477694,080,335645,526,00025,980,00016,953,344
9Mar 10, 2026 21:104,608712,350,935663,262,00027,968,00017,100,800