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 14, 2026 11:29Victor MerckléVictor MerckléScore: 1,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 11:301,40712,463,4212,454,0001,065,0002,117,632stderr
2Sep 14, 2026 11:301,43512,370,7232,500,0001,089,0002,117,632stderr
3Sep 14, 2026 11:301,43812,339,8632,509,0001,088,0002,117,632stderr
4Sep 14, 2026 11:301,43912,209,7232,493,0001,105,0002,117,632stderr
5Sep 14, 2026 11:301,43912,330,6842,521,0001,078,0002,117,632stderr
6Sep 14, 2026 11:301,47912,420,3582,589,0001,110,0002,117,632stderr
7Sep 14, 2026 11:301,49612,254,1622,620,0001,122,0002,117,632stderr
8Sep 14, 2026 11:301,52012,380,6162,663,0001,139,0002,117,632stderr
9Sep 14, 2026 11:301,53212,574,2902,704,0001,128,0002,117,632stderr