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 23, 2026 03:06Dominique GarmierDominique GarmierScore: 4,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 03:064,465697,629,756648,808,00020,993,00017,076,224
2Mar 23, 2026 03:414,466695,550,034647,856,00021,995,00017,080,320
3Mar 23, 2026 03:414,476700,803,476645,384,00025,975,00016,957,440
4Mar 23, 2026 03:064,477699,749,188647,611,00023,985,00017,080,320
5Mar 23, 2026 03:064,487700,265,131649,023,00024,000,00016,957,440
6Mar 23, 2026 03:414,491699,645,170647,675,00025,986,00017,014,784