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:05Yuriy 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:053,921658,574,650588,112,374016,941,056
2Apr 1, 2023 21:053,921654,038,599588,166,861016,945,152
3Apr 1, 2023 21:053,922653,862,999588,234,018016,941,056
4Apr 1, 2023 21:053,942618,370,849569,266,00022,010,00017,137,664
5Apr 1, 2023 21:053,942618,639,871565,331,00026,015,00017,084,416
6Apr 1, 2023 21:053,943623,267,052564,538,00026,977,00016,961,536
7Apr 1, 2023 21:053,944618,145,687565,594,00025,981,00017,084,416
8Apr 1, 2023 21:053,944613,738,996564,648,00026,983,00017,092,608
9Apr 1, 2023 21:053,944613,429,849566,666,00024,985,00016,949,248
10Apr 1, 2023 21:053,944616,084,473565,677,00025,985,00016,953,344
11Apr 1, 2023 21:053,946619,298,907567,854,00023,993,00017,195,008
12Apr 1, 2023 21:053,946613,924,772563,876,00027,993,00017,014,784