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 listJan 5, 2026 04:29Josu San MartinJosu San MartinScore: 3,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 04:293,137500,232,873430,572,00039,960,00017,190,912
2Jan 5, 2026 04:293,145497,117,181426,737,00044,972,00017,080,320
3Jan 5, 2026 04:293,146500,876,763435,927,00035,994,00017,055,744
4Jan 5, 2026 04:293,149506,851,545428,471,00043,945,00016,961,536
5Jan 5, 2026 04:293,153502,130,733432,962,00039,996,00017,076,224
6Jan 5, 2026 04:293,153509,925,252437,971,00034,997,00016,973,824
7Jan 5, 2026 04:293,161500,213,982434,284,00039,934,00017,182,720
8Jan 5, 2026 04:293,163497,298,880436,476,00037,954,00017,108,992
9Jan 5, 2026 04:293,188506,232,849443,155,00035,012,00016,973,824