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 listApr 26, 2026 15:27Victor MerckléVictor MerckléScore: 2,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:292,190345,022,615317,618,00010,986,00017,162,240
2Apr 26, 2026 15:292,190346,037,983317,647,00010,987,00017,174,528
3Apr 26, 2026 15:292,191346,968,621317,741,00010,991,00017,174,528
4Apr 26, 2026 15:292,191346,523,478319,663,0008,990,00017,166,336
5Apr 26, 2026 15:292,191346,429,389317,739,00010,990,00017,170,432
6Apr 26, 2026 15:292,192343,884,880316,880,00011,995,00017,170,432
7Apr 26, 2026 15:292,193345,385,116320,982,0007,999,00017,154,048
8Apr 26, 2026 15:292,194349,633,229319,110,00010,003,00017,158,144
9Apr 26, 2026 15:292,196344,305,626319,432,0009,982,00017,154,048