Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 30, 2026 13:19Victor MerckléVictor MerckléScore: 2,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 13:212,61914,628,6295,203,0001,345,0002,113,536
2May 30, 2026 13:212,62214,492,9305,206,0001,349,0002,113,536
3May 30, 2026 13:212,62914,304,6495,225,0001,348,0002,113,536
4May 30, 2026 13:212,63114,275,3235,230,0001,348,0002,113,536
5May 30, 2026 13:212,63615,390,0615,244,0001,348,0002,113,536
6May 30, 2026 13:212,65414,822,1555,269,0001,366,0002,113,536
7May 30, 2026 13:212,68316,686,9885,327,0001,381,0002,113,536
8May 30, 2026 13:212,71316,236,8525,436,0001,347,0002,113,536
9May 30, 2026 13:212,77617,077,7024,637,0002,305,0002,113,536