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 27, 2026 23:25Dominique GarmierDominique GarmierScore: 3,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 23:253,304527,140,088467,635,00027,978,00016,990,208
2Mar 27, 2026 23:253,310519,767,638468,523,00027,971,00017,047,552
3Mar 27, 2026 23:253,312527,405,085468,860,00027,991,00017,068,032
4Mar 27, 2026 23:253,316528,323,151466,447,00030,963,00017,031,168
5Mar 27, 2026 23:253,316524,268,852473,454,00023,972,00017,149,952
6Mar 27, 2026 23:253,321523,381,456473,114,00025,006,00017,055,744
7Mar 27, 2026 23:253,322526,893,501473,373,00024,966,00017,047,552
8Mar 27, 2026 23:253,326527,573,852470,866,00027,992,00017,047,552
9Mar 27, 2026 23:253,341531,442,288474,166,00027,009,00016,990,208