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 21, 2026 15:16Charles CabergsCharles CabergsScore: 3,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 15:173,983613,904,628588,596,0008,993,00017,207,296
2Apr 21, 2026 15:173,986618,407,139589,009,0009,000,00017,211,392
3Apr 21, 2026 15:173,988614,865,414588,309,0009,988,00017,215,488
4Apr 21, 2026 15:173,989618,347,134588,481,0009,991,00017,006,592
5Apr 21, 2026 15:173,993618,852,179590,068,0009,001,00016,990,208
6Apr 21, 2026 15:173,993617,039,025590,021,0009,000,00016,994,304
7Apr 21, 2026 15:173,993618,428,305590,075,0009,001,00017,203,200
8Apr 21, 2026 15:173,994614,331,477590,132,0009,002,00017,215,488
9Apr 21, 2026 15:173,997615,090,057590,655,0008,994,00017,043,456