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 29, 2026 16:36Victor MerckléVictor MerckléScore: 1,476Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 05:28Tomislav Tunkovic21.77CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 16:441,46513,825,4912,593,0001,071,0002,117,632stderr
2Aug 29, 2026 16:441,47012,186,2842,601,0001,075,0002,117,632stderr
3Aug 29, 2026 16:441,47112,075,1922,606,0001,073,0002,117,632stderr
4Aug 29, 2026 16:441,47413,228,2742,614,0001,073,0002,117,632stderr
5Aug 29, 2026 16:441,47611,949,9722,614,0001,077,0002,117,632stderr
6Aug 29, 2026 16:441,48011,911,0312,616,0001,084,0002,117,632stderr
7Aug 29, 2026 16:441,48012,125,8492,616,0001,084,0002,117,632stderr
8Aug 29, 2026 16:441,53012,157,9392,724,0001,103,0002,117,632stderr
9Aug 29, 2026 16:441,55012,090,8562,751,0001,124,0002,117,632stderr