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 31, 2025 17:04Yuriy LyfenkoYuriy LyfenkoScore: 3,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 17:043,936615,168,275565,482,00024,977,00017,080,320
2Aug 31, 2025 17:043,938617,694,128564,735,00025,987,00017,117,184
3Aug 31, 2025 17:043,939618,198,264563,812,00026,991,00016,957,440
4Aug 31, 2025 17:043,941617,362,325564,085,00027,004,00016,965,632
5Aug 31, 2025 17:043,942619,211,282564,220,00027,010,00016,969,728
6Aug 31, 2025 17:043,942618,589,912564,222,00027,010,00016,957,440
7Aug 31, 2025 17:043,942621,311,302567,239,00024,010,00017,014,784
8Aug 31, 2025 17:043,942617,817,958569,315,00022,012,00017,072,128
9Aug 31, 2025 17:043,943618,630,879566,404,00024,973,00016,965,632