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 09:45Victor MerckléVictor MerckléScore: 1,799Success
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 09:471,78612,863,0963,254,0001,212,0002,117,632stderr
2Aug 29, 2026 09:471,78612,935,3343,307,0001,158,0002,117,632stderr
3Aug 29, 2026 09:471,78712,893,1703,254,0001,214,0002,117,632stderr
4Aug 29, 2026 09:471,79013,038,4233,167,0001,309,0002,117,632stderr
5Aug 29, 2026 09:471,79912,942,9873,276,0001,223,0002,117,632stderr
6Aug 29, 2026 09:471,80612,918,4163,285,0001,232,0002,117,632stderr
7Aug 29, 2026 09:471,82112,938,6063,302,0001,251,0002,117,632stderr
8Aug 29, 2026 09:471,83813,091,0953,317,0001,279,0002,117,632stderr
9Aug 29, 2026 09:471,83912,945,9743,322,0001,276,0002,117,632stderr