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 25, 2026 20:32Dominique GarmierDominique GarmierScore: 4,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 21:074,229655,788,116623,430,00010,989,00017,039,360
2Mar 25, 2026 21:074,230660,722,450622,523,00011,990,00017,182,720
3Mar 25, 2026 20:324,232656,418,138623,821,00010,996,00017,018,880
4Mar 25, 2026 21:074,236658,154,029623,470,00011,989,00017,166,336
5Mar 25, 2026 20:324,248660,659,270625,181,00011,984,00017,092,608
6Mar 25, 2026 20:324,268669,333,880627,161,00012,982,00017,072,128