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 listApr 26, 2026 04:16olliecrowolliecrowScore: 3,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 04:173,175497,042,836471,374,0004,993,00017,174,528
2Apr 26, 2026 04:173,177494,889,311471,662,0004,996,00017,174,528
3Apr 26, 2026 04:173,177497,920,984471,649,0004,996,00017,178,624
4Apr 26, 2026 04:173,178494,793,992471,768,0004,997,00017,014,784
5Apr 26, 2026 04:173,181494,461,676473,172,0004,001,00017,170,432
6Apr 26, 2026 04:173,182494,253,682473,347,0004,002,00017,182,720
7Apr 26, 2026 04:173,188494,671,490474,322,0004,002,00017,178,624
8Apr 26, 2026 04:173,190501,415,379473,512,0004,994,00017,170,432
9Apr 26, 2026 04:173,195495,388,968475,283,0004,002,00017,174,528