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 listJun 18, 2026 12:39Victor MerckléVictor MerckléScore: 1,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 12:401,646256,099,536239,154,0007,841,00016,797,696
2Jun 18, 2026 12:401,647256,281,080239,155,0007,971,00016,797,696
3Jun 18, 2026 12:401,648256,391,690239,343,0007,907,00016,797,696
4Jun 18, 2026 12:401,648256,378,290239,342,0007,909,00016,797,696
5Jun 18, 2026 12:401,649256,536,969239,552,0007,858,00016,797,696
6Jun 18, 2026 12:401,649256,488,286239,232,0008,184,00016,797,696
7Jun 18, 2026 12:401,651256,792,031239,757,0007,912,00016,797,696
8Jun 18, 2026 12:401,653257,083,649239,937,0008,034,00016,797,696
9Jun 18, 2026 12:401,654257,616,806240,070,0008,086,00016,797,696