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 18:01olliecrowolliecrowScore: 3,418Success
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 18:013,415528,458,745509,340,0003,002,00017,137,664
2Apr 21, 2026 18:013,416531,111,955508,495,0003,996,00017,014,784
3Apr 21, 2026 18:013,416530,979,274509,493,0002,997,00017,108,992
4Apr 21, 2026 18:013,417529,475,221507,612,0004,996,00017,215,488
5Apr 21, 2026 18:013,418529,972,764507,739,0004,997,00017,100,800
6Apr 21, 2026 18:013,418536,144,084509,741,0002,998,00017,014,784
7Apr 21, 2026 18:013,418530,052,745510,736,0001,998,00017,137,664
8Apr 21, 2026 18:013,419530,795,694510,998,0001,999,00017,006,592
9Apr 21, 2026 18:013,421530,145,163509,280,0003,994,00017,235,968