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 listMar 20, 2023 22:57Yuriy LyfenkoYuriy LyfenkoScore: 11,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2023 22:507,4561,176,625,3251,118,354,153016,949,248
2Mar 20, 2023 22:507,4741,199,337,9591,121,064,079016,949,248
3Mar 20, 2023 22:507,5221,201,807,0731,128,262,183016,945,152
4Mar 20, 2023 22:4911,3081,765,436,4551,696,274,038016,949,248
5Mar 20, 2023 22:4911,3311,768,416,0681,699,639,285016,945,152
6Mar 20, 2023 22:4911,3711,775,953,4741,705,655,812016,945,152
7Mar 20, 2023 22:5712,9152,011,688,5931,937,319,509016,957,440
8Mar 20, 2023 22:5712,9242,005,526,7211,938,561,403016,945,152
9Mar 20, 2023 22:5712,9402,000,523,4121,941,030,908016,949,248