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 18:59olliecrowolliecrowScore: 9,701Success
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 18:599,6481,477,668,0711,433,233,00013,973,00016,949,248
2Mar 4, 2026 18:599,6531,474,319,6361,431,972,00015,966,00017,088,512
3Mar 4, 2026 18:599,6571,481,265,0731,432,528,00015,972,00016,965,632
4Mar 4, 2026 18:599,6831,480,865,7741,445,459,0006,987,00017,039,360
5Mar 4, 2026 18:599,7011,487,471,9371,442,215,00012,974,00016,957,440
6Mar 4, 2026 18:599,7041,488,602,2341,444,645,00010,982,00016,965,632
7Mar 4, 2026 18:599,7171,488,310,2491,449,598,0007,986,00016,965,632
8Mar 4, 2026 18:599,7231,486,341,6351,446,544,00011,979,00017,129,472
9Mar 4, 2026 18:599,7331,490,002,9931,449,901,0009,978,00016,957,440