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, 2024 22:19Yuriy LyfenkoYuriy LyfenkoScore: 3,943Success
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, 2024 22:193,939616,684,677567,899,00022,995,00016,977,920
2Aug 31, 2024 22:193,940617,806,522564,947,00025,997,00017,195,008
3Aug 31, 2024 22:193,940613,591,739565,952,00024,997,00017,113,088
4Aug 31, 2024 22:193,942619,919,081569,294,00022,011,00017,186,816
5Aug 31, 2024 22:193,943620,482,486565,528,00025,978,00016,957,440
6Aug 31, 2024 22:193,943614,605,606568,482,00022,979,00017,186,816
7Aug 31, 2024 22:193,943617,322,888567,526,00023,980,00016,949,248
8Aug 31, 2024 22:193,943615,446,867569,541,00021,982,00017,068,032
9Aug 31, 2024 22:193,944619,172,135571,610,00019,986,00017,203,200
10Aug 31, 2024 22:193,944615,166,115563,550,00027,977,00017,018,880
11Aug 31, 2024 22:193,944615,145,261563,557,00027,978,00016,990,208
12Aug 31, 2024 22:193,945619,614,320569,707,00021,988,00016,949,248