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 4, 2026 20:37olliecrowolliecrowScore: 3,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:373,630574,902,358523,546,00020,981,00017,051,648
2Mar 4, 2026 20:373,631571,934,530526,610,00017,986,00017,047,552
3Mar 4, 2026 20:373,632572,228,061526,813,00017,993,00017,051,648
4Mar 4, 2026 20:373,634573,030,288527,079,00018,002,00017,059,840
5Mar 4, 2026 20:373,636570,135,661525,315,00020,012,00017,031,168
6Mar 4, 2026 20:373,636570,042,757525,434,00019,978,00016,973,824
7Mar 4, 2026 20:373,636577,758,903523,436,00021,976,00017,006,592
8Mar 4, 2026 20:373,638572,665,125520,756,00024,988,00017,063,936
9Mar 4, 2026 20:373,641584,762,391526,094,00020,003,00017,051,648