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 19, 2026 17:05Dominique GarmierDominique GarmierScore: 4,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 17:054,715734,249,756677,212,00029,965,00017,047,552
2Mar 19, 2026 17:054,721739,226,261679,221,00028,966,00016,957,440
3Mar 19, 2026 17:054,725738,150,440679,746,00028,946,00017,199,104
4Mar 19, 2026 17:054,731739,772,938681,656,00027,944,00017,096,704
5Mar 19, 2026 17:054,737742,046,945678,669,00031,937,00016,949,248
6Mar 19, 2026 17:054,747743,843,914680,024,00031,954,00017,043,456
7Mar 19, 2026 17:054,779744,352,728686,909,00029,952,00017,043,456
8Mar 19, 2026 17:054,784744,912,294687,669,00029,942,00016,957,440
9Mar 19, 2026 17:054,792745,265,046689,849,00028,951,00017,186,816