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 20, 2026 16:50BenBenScore: 4,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:534,128643,538,924595,219,00024,008,00017,154,048
2Apr 20, 2026 16:534,138650,152,537597,769,00022,991,00017,154,048
3Apr 20, 2026 16:534,145648,320,307598,873,00022,995,00017,149,952
4Apr 20, 2026 16:534,147644,837,412598,070,00024,002,00017,145,856
5Apr 20, 2026 16:534,154653,479,939599,225,00024,009,00017,158,144
6Apr 20, 2026 16:534,158646,572,156603,746,00019,991,00017,154,048
7Apr 20, 2026 16:534,162656,345,245601,350,00022,975,00017,154,048
8Apr 20, 2026 16:534,166638,465,430603,030,00022,001,00017,072,128
9Apr 20, 2026 16:534,208660,475,857607,215,00024,008,00017,149,952