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 21:46olliecrowolliecrowScore: 3,565Success
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 21:463,562556,502,838521,371,00012,984,00017,207,296
2Mar 4, 2026 21:463,564562,744,265521,581,00012,989,00016,977,920
3Mar 4, 2026 21:463,564563,233,177523,638,00010,992,00017,113,088
4Mar 4, 2026 21:463,565559,758,085522,702,00011,993,00016,949,248
5Mar 4, 2026 21:463,565560,053,568523,745,00010,994,00016,982,016
6Mar 4, 2026 21:463,565558,958,480521,761,00012,994,00017,199,104
7Mar 4, 2026 21:463,566567,340,574525,961,0008,999,00017,158,144
8Mar 4, 2026 21:463,568565,511,709523,222,00012,005,00016,982,016
9Mar 4, 2026 21:463,569560,645,850522,311,00012,982,00017,174,528