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 listAug 17, 2026 03:48marko1597marko1597Score: 3,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:113,280501,897,374489,051,0003,056,00016,801,792stderr
2Aug 17, 2026 04:113,280501,915,654489,052,0003,082,00016,801,792stderr
3Aug 17, 2026 04:113,280506,797,792488,985,0003,085,00016,801,792stderr
4Aug 17, 2026 04:113,281502,032,402489,109,0003,094,00016,801,792stderr
5Aug 17, 2026 04:113,281502,071,935489,131,0003,083,00016,801,792stderr
6Aug 17, 2026 04:113,281502,147,248489,161,0003,102,00016,801,792stderr
7Aug 17, 2026 04:113,284502,392,669489,443,0003,170,00016,801,792stderr
8Aug 17, 2026 04:113,284502,586,551489,604,0003,079,00016,801,792stderr
9Aug 17, 2026 04:113,303506,705,459492,410,0003,094,00016,801,792stderr