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 13:22Victor MerckléVictor MerckléScore: 1,490Success
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 13:241,42712,324,3042,491,0001,077,0002,117,632stderr
2Sep 14, 2026 13:241,44512,314,5602,522,0001,092,0002,117,632stderr
3Sep 14, 2026 13:241,47314,144,6522,522,0001,162,0002,117,632stderr
4Sep 14, 2026 13:241,47812,526,3342,591,0001,104,0002,117,632stderr
5Sep 14, 2026 13:241,49012,444,4322,603,0001,123,0002,117,632stderr
6Sep 14, 2026 13:241,49212,591,2592,616,0001,115,0002,117,632stderr
7Sep 14, 2026 13:241,50712,659,9262,622,0001,146,0002,117,632stderr
8Sep 14, 2026 13:241,50812,350,9132,615,0001,156,0002,117,632stderr
9Sep 14, 2026 13:241,53820,225,0262,664,0001,183,0002,117,632stderr