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 17, 2026 02:26Jasper EdbrookeJasper EdbrookeScore: 15,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 02:2615,6062,366,904,6892,322,893,00017,991,00017,170,432
2Apr 17, 2026 02:2615,6372,377,456,7652,324,549,00020,986,00017,211,392
3Apr 17, 2026 02:2615,6522,376,646,3332,328,738,00018,989,00017,166,336