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 28, 2026 20:41olliecrowolliecrowScore: 3,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 20:433,172483,171,589472,930,0002,999,00016,994,304
2Apr 28, 2026 20:433,175491,260,404472,309,0004,002,00017,018,880
3Apr 28, 2026 20:433,178483,869,859471,799,0004,997,00017,154,048
4Apr 28, 2026 20:433,180484,007,014473,086,0004,000,00017,199,104
5Apr 28, 2026 20:433,180491,296,426473,148,0004,001,00017,002,496
6Apr 28, 2026 20:433,183484,666,912471,572,0005,994,00017,006,592
7Apr 28, 2026 20:433,183484,657,409471,572,0005,994,00017,018,880
8Apr 28, 2026 20:433,189484,543,051472,421,0005,992,00017,072,128
9Apr 28, 2026 20:433,194485,272,670475,186,0004,001,00017,203,200