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 27, 2026 20:52Charles CabergsCharles CabergsScore: 3,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 20:523,877595,976,163572,661,0008,994,00017,125,376
2Apr 27, 2026 20:523,880603,036,805573,088,0009,001,00017,010,688
3Apr 27, 2026 20:523,881597,583,514574,249,0008,003,00016,990,208
4Apr 27, 2026 20:523,883597,489,440574,494,0008,006,00017,129,472
5Apr 27, 2026 20:523,883598,418,575573,490,0008,992,00016,998,400
6Apr 27, 2026 20:523,885598,691,606573,848,0008,997,00016,998,400
7Apr 27, 2026 20:523,886600,384,092574,031,0009,000,00016,990,208
8Apr 27, 2026 20:523,887597,641,450574,098,0009,001,00017,141,760
9Apr 27, 2026 20:523,891603,491,320574,672,0008,994,00017,129,472