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 listAug 1, 2026 18:46Victor MerckléVictor MerckléScore: 1,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 18:481,58912,383,5332,882,0001,091,0002,117,632stderr
2Aug 1, 2026 18:481,69312,774,3163,101,0001,133,0002,117,632stderr
3Aug 1, 2026 18:481,69512,846,6223,112,0001,126,0002,117,632stderr
4Aug 1, 2026 18:481,69813,093,9793,112,0001,133,0002,117,632stderr
5Aug 1, 2026 18:481,70313,371,2963,129,0001,129,0002,117,632stderr
6Aug 1, 2026 18:481,70612,777,8183,130,0001,136,0002,117,632stderr
7Aug 1, 2026 18:481,71312,787,7813,149,0001,135,0002,117,632stderr
8Aug 1, 2026 18:481,71813,446,8673,136,0001,161,0002,117,632stderr
9Aug 1, 2026 18:481,73913,495,7413,173,0001,175,0002,117,632stderr