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 listSep 10, 2026 09:12Victor MerckléVictor MerckléScore: 3,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 09:153,53217,188,4307,438,0001,392,0002,121,728stderr
2Sep 10, 2026 09:153,54017,923,5747,612,0001,240,0002,121,728stderr
3Sep 10, 2026 09:153,56617,508,0587,531,0001,386,0002,121,728stderr
4Sep 10, 2026 09:153,56717,428,3607,667,0001,252,0002,121,728stderr
5Sep 10, 2026 09:153,56817,675,0577,522,0001,398,0002,121,728stderr
6Sep 10, 2026 09:153,57717,358,2697,679,0001,264,0002,121,728stderr
7Sep 10, 2026 09:153,59617,563,1927,565,0001,427,0002,121,728stderr
8Sep 10, 2026 09:153,59817,923,9967,585,0001,411,0002,121,728stderr
9Sep 10, 2026 09:153,61017,310,2587,616,0001,409,0002,121,728stderr