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 13:09Victor MerckléVictor MerckléScore: 1,632Success
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 13:111,58212,368,6382,853,0001,102,0002,117,632stderr
2Aug 29, 2026 13:111,61012,338,3082,907,0001,119,0002,117,632stderr
3Aug 29, 2026 13:111,62212,465,0542,921,0001,136,0002,117,632stderr
4Aug 29, 2026 13:111,62812,576,5602,975,0001,095,0002,117,632stderr
5Aug 29, 2026 13:111,63212,522,0462,936,0001,145,0002,117,632stderr
6Aug 29, 2026 13:111,64312,502,5722,979,0001,130,0002,117,632stderr
7Aug 29, 2026 13:111,66012,500,6302,992,0001,160,0002,117,632stderr
8Aug 29, 2026 13:111,66012,498,3722,896,0001,254,0002,117,632stderr
9Aug 29, 2026 13:111,66013,625,2463,008,0001,144,0002,117,632stderr