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 10:01Victor MerckléVictor MerckléScore: 1,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 10:051,59814,199,3442,914,0001,081,0002,117,632stderr
2Aug 29, 2026 10:051,60212,302,8862,900,0001,106,0002,117,632stderr
3Aug 29, 2026 10:051,60312,381,4972,906,0001,103,0002,117,632stderr
4Aug 29, 2026 10:051,61212,397,3732,922,0001,109,0002,117,632stderr
5Aug 29, 2026 10:051,62512,453,8772,926,0001,138,0002,117,632stderr
6Aug 29, 2026 10:051,62612,445,7212,946,0001,119,0002,117,632stderr
7Aug 29, 2026 10:051,66012,537,3572,910,0001,241,0002,117,632stderr
8Aug 29, 2026 10:051,68812,632,8433,083,0001,139,0002,117,632stderr
9Aug 29, 2026 10:051,71513,400,9993,137,0001,151,0002,117,632stderr