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 08:45Victor MerckléVictor MerckléScore: 1,594Success
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 08:461,58212,274,2012,870,0001,086,0002,117,632stderr
2Aug 29, 2026 08:461,58312,307,1592,862,0001,096,0002,117,632stderr
3Aug 29, 2026 08:461,58612,355,4792,873,0001,094,0002,117,632stderr
4Aug 29, 2026 08:461,59312,381,7422,874,0001,109,0002,117,632stderr
5Aug 29, 2026 08:461,59412,318,9842,880,0001,107,0002,117,632stderr
6Aug 29, 2026 08:461,59912,376,1082,889,0001,109,0002,117,632stderr
7Aug 29, 2026 08:461,60012,423,4532,896,0001,106,0002,117,632stderr
8Aug 29, 2026 08:461,65212,461,2482,995,0001,137,0002,117,632stderr
9Aug 29, 2026 08:461,69412,635,7623,092,0001,144,0002,117,632stderr