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 1, 2026 03:59Charles CabergsCharles CabergsScore: 3,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 04:003,805586,651,696564,827,0005,998,00017,207,296
2May 1, 2026 04:003,805585,913,725564,830,0005,998,00017,207,296
3May 1, 2026 04:003,807589,469,137566,073,0005,000,00017,203,200
4May 1, 2026 04:003,807589,990,680565,059,0006,000,00017,207,296
5May 1, 2026 04:003,807595,947,111565,099,0005,990,00017,010,688
6May 1, 2026 04:003,808589,672,982567,284,0004,002,00017,215,488
7May 1, 2026 04:003,808591,129,117567,316,0004,002,00017,215,488
8May 1, 2026 04:003,808586,381,604566,238,0005,002,00017,006,592
9May 1, 2026 04:003,809590,273,759565,388,0005,993,00017,211,392