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 listNov 4, 2026 03:06Andrew EpsteinAndrew EpsteinScore: 1,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 03:101,543240,883,893227,406,0004,114,00016,797,696
2Nov 4, 2026 03:101,545241,101,832227,651,0004,148,00016,797,696
3Nov 4, 2026 03:101,545241,034,157227,738,0004,132,00016,797,696
4Nov 4, 2026 03:101,545241,016,454227,604,0004,171,00016,797,696
5Nov 4, 2026 03:101,546241,196,169227,790,0004,170,00016,797,696
6Nov 4, 2026 03:101,547241,445,636227,880,0004,186,00016,797,696
7Nov 4, 2026 03:101,549241,643,564228,260,0004,150,00016,797,696
8Nov 4, 2026 03:101,549241,570,075228,245,0004,156,00016,797,696
9Nov 4, 2026 03:101,553242,161,115228,856,0004,146,00016,797,696