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 28, 2026 20:15olliecrowolliecrowScore: 3,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 20:183,198499,275,582473,741,0005,996,00016,994,304
2Apr 28, 2026 20:183,201488,782,934474,168,0006,002,00017,014,784
3Apr 28, 2026 20:183,204489,331,594475,742,0004,997,00017,022,976
4Apr 28, 2026 20:183,205489,430,157474,874,0005,998,00017,027,072
5Apr 28, 2026 20:183,205489,577,501473,799,0006,997,00017,080,320
6Apr 28, 2026 20:183,207489,871,193474,185,0007,002,00017,014,784
7Apr 28, 2026 20:183,209489,882,617473,460,0007,990,00016,990,208
8Apr 28, 2026 20:183,210498,224,727472,574,0008,991,00016,998,400
9Apr 28, 2026 20:184,578706,640,693681,730,0004,998,00016,994,304