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 04:26marko1597marko1597Score: 2,443Success
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:432,441377,702,676361,015,0005,273,00016,801,792stderr
2Aug 17, 2026 04:432,441376,712,828360,822,0005,372,00016,801,792stderr
3Aug 17, 2026 04:432,441376,887,886360,899,0005,251,00016,801,792stderr
4Aug 17, 2026 04:432,442376,350,228361,134,0005,263,00016,801,792stderr
5Aug 17, 2026 04:432,443376,405,405361,110,0005,376,00016,801,792stderr
6Aug 17, 2026 04:432,444376,628,033361,379,0005,223,00016,801,792stderr
7Aug 17, 2026 04:432,446376,940,520361,699,0005,266,00016,801,792stderr
8Aug 17, 2026 04:432,447378,280,751361,903,0005,250,00016,801,792stderr
9Aug 17, 2026 04:432,448378,027,707362,025,0005,292,00016,801,792stderr