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 listApr 1, 2023 21:18Yuriy LyfenkoYuriy LyfenkoScore: 3,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 21:183,920654,005,430588,035,151016,945,152
2Apr 1, 2023 21:183,921655,216,501588,113,291016,941,056
3Apr 1, 2023 21:183,922658,409,759588,303,937016,941,056
4Apr 1, 2023 21:183,943617,557,645565,467,00025,975,00017,125,376
5Apr 1, 2023 21:183,944621,503,707565,641,00025,983,00016,957,440
6Apr 1, 2023 21:183,944620,989,478565,647,00025,983,00017,072,128
7Apr 1, 2023 21:183,944613,886,543565,657,00025,984,00016,961,536
8Apr 1, 2023 21:183,944616,923,872565,671,00025,984,00016,969,728
9Apr 1, 2023 21:183,945619,039,498570,782,00020,992,00016,986,112
10Apr 1, 2023 21:183,946616,182,555564,839,00026,992,00016,957,440
11Apr 1, 2023 21:183,946614,441,144568,958,00022,998,00017,195,008
12Apr 1, 2023 21:183,947620,075,506568,992,00022,999,00016,969,728