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 30, 2026 21:39Victor MerckléVictor MerckléScore: 1,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:421,47211,884,3212,616,0001,065,0002,117,632stderr
2Aug 30, 2026 21:421,48812,165,7552,637,0001,084,0002,117,632stderr
3Aug 30, 2026 21:421,54212,163,0772,748,0001,108,0002,117,632stderr
4Aug 30, 2026 21:421,57913,728,0062,830,0001,118,0002,117,632stderr
5Aug 30, 2026 21:421,58012,321,8672,831,0001,119,0002,117,632stderr
6Aug 30, 2026 21:421,58212,176,2962,831,0001,124,0002,117,632stderr
7Aug 30, 2026 21:421,58812,341,2392,845,0001,126,0002,117,632stderr
8Aug 30, 2026 21:421,59712,240,1962,851,0001,142,0002,117,632stderr
9Aug 30, 2026 21:421,60513,060,5362,885,0001,128,0002,117,632stderr