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 23, 2026 03:03Dominique GarmierDominique GarmierScore: 4,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 03:404,269671,749,853615,405,00024,975,00017,043,456
2Mar 23, 2026 03:034,278669,146,839618,708,00022,989,00017,199,104
3Mar 23, 2026 03:404,295671,501,265617,182,00027,007,00017,039,360
4Mar 23, 2026 03:034,298674,795,431622,683,00021,988,00016,965,632
5Mar 23, 2026 03:034,347680,995,643626,027,00026,001,00017,027,072
6Mar 23, 2026 03:404,348684,616,248626,299,00025,970,00017,039,360