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 20:46Yuriy LyfenkoYuriy LyfenkoScore: 4,211Success
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 20:464,129687,565,244619,404,183016,949,248
2Apr 1, 2023 20:464,130680,588,856619,542,162016,941,056
3Apr 1, 2023 20:464,131677,463,823619,637,574016,941,056
4Apr 1, 2023 20:464,206655,230,381604,900,00025,995,00016,965,632
5Apr 1, 2023 20:464,207658,105,529601,166,00029,958,00017,010,688
6Apr 1, 2023 20:464,208657,987,220605,195,00025,965,00017,125,376
7Apr 1, 2023 20:464,211654,439,696605,649,00025,984,00017,162,240
8Apr 1, 2023 20:464,214660,213,565605,084,00026,959,00017,195,008
9Apr 1, 2023 20:464,216655,740,359601,373,00030,967,00017,047,552
10Apr 1, 2023 20:464,227662,041,723605,048,00028,954,00017,158,144
11Apr 1, 2023 20:464,228664,208,641609,207,00024,967,00016,977,920
12Apr 1, 2023 20:464,237658,571,758612,531,00022,982,00017,182,720