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 listMay 6, 2026 00:17olliecrowolliecrowScore: 3,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 00:183,548547,889,561494,296,00038,032,00017,235,968
2May 6, 2026 00:183,548551,255,342494,298,00037,938,00017,231,872
3May 6, 2026 00:183,550551,301,791494,638,00038,003,00017,186,816
4May 6, 2026 00:183,554550,911,419494,813,00038,398,00017,215,488
5May 6, 2026 00:183,554551,803,382494,171,00039,013,00017,207,296
6May 6, 2026 00:183,554553,064,998494,774,00038,388,00017,145,856
7May 6, 2026 00:183,555550,630,611494,758,00038,623,00017,215,488
8May 6, 2026 00:183,556551,439,742494,573,00038,913,00017,219,584
9May 6, 2026 00:183,559553,353,234496,116,00037,848,00017,178,624