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 19:49Yuriy LyfenkoYuriy LyfenkoScore: 4,223Success
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 19:494,136681,337,118620,437,836016,945,152
2Apr 1, 2023 19:494,144688,180,920621,636,117016,941,056
3Apr 1, 2023 19:494,146705,333,216621,825,326016,945,152
4Apr 1, 2023 19:494,210654,839,125606,476,00024,978,00017,047,552
5Apr 1, 2023 19:494,212659,888,879607,737,00023,989,00017,047,552
6Apr 1, 2023 19:494,217658,332,987606,633,00025,984,00016,957,440
7Apr 1, 2023 19:494,223656,732,669606,415,00026,974,00017,076,224
8Apr 1, 2023 19:494,228661,770,940608,261,00025,968,00016,961,536
9Apr 1, 2023 19:494,228660,332,782607,281,00026,968,00016,969,728
10Apr 1, 2023 19:494,230657,132,612610,493,00023,980,00016,969,728
11Apr 1, 2023 19:494,230659,197,420612,556,00021,984,00016,961,536
12Apr 1, 2023 19:494,236660,082,773609,425,00025,975,00017,084,416