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:18Yuriy 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:183,938613,919,602565,689,00024,986,00016,945,152
2Aug 31, 2024 22:183,938613,689,819566,697,00023,987,00016,945,152
3Aug 31, 2024 22:183,940619,997,163565,030,00026,001,00017,133,568
4Aug 31, 2024 22:183,941615,319,426570,102,00021,003,00017,174,528
5Aug 31, 2024 22:183,942617,267,509564,391,00026,970,00017,207,296
6Aug 31, 2024 22:183,943619,022,355568,387,00023,015,00016,945,152
7Aug 31, 2024 22:183,943620,689,340564,534,00026,977,00016,973,824
8Aug 31, 2024 22:183,944613,454,548564,570,00026,979,00016,945,152
9Aug 31, 2024 22:183,944614,532,210567,571,00023,981,00016,949,248
10Aug 31, 2024 22:183,944613,986,460568,607,00022,984,00017,141,760
11Aug 31, 2024 22:183,945621,571,607565,708,00025,986,00017,113,088
12Aug 31, 2024 22:183,945617,250,994565,737,00025,987,00017,080,320