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 listAug 17, 2026 05:09marko1597marko1597Score: 2,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:452,506386,710,635370,702,0005,337,00016,801,792stderr
2Aug 17, 2026 05:452,506385,928,447370,639,0005,330,00016,801,792stderr
3Aug 17, 2026 05:452,508386,384,821370,987,0005,338,00016,801,792stderr
4Aug 17, 2026 05:452,509387,044,593371,037,0005,352,00016,801,792stderr
5Aug 17, 2026 05:452,509386,505,422371,034,0005,345,00016,801,792stderr
6Aug 17, 2026 05:452,509386,351,674371,085,0005,325,00016,801,792stderr
7Aug 17, 2026 05:452,510386,525,064371,319,0005,209,00016,801,792stderr
8Aug 17, 2026 05:452,514387,145,082371,882,0005,265,00016,801,792stderr
9Aug 17, 2026 05:452,514387,124,110371,851,0005,266,00016,801,792stderr