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 17, 2026 01:36Victor MerckléVictor MerckléScore: 2,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 01:492,82216,739,3694,467,0002,588,0002,142,208stderr
2Aug 17, 2026 01:492,83216,708,9224,835,0002,247,0002,142,208stderr
3Aug 17, 2026 01:492,84616,878,5284,460,0002,656,0002,142,208stderr
4Aug 17, 2026 01:492,84816,841,9284,872,0002,250,0002,142,208stderr
5Aug 17, 2026 01:492,85016,827,8914,899,0002,228,0002,142,208stderr
6Aug 17, 2026 01:492,87816,880,9894,554,0002,641,0002,142,208stderr
7Aug 17, 2026 01:492,88616,817,2234,984,0002,232,0002,142,208stderr
8Aug 17, 2026 01:492,88616,873,4654,291,0002,926,0002,195,456stderr
9Aug 17, 2026 01:492,91217,024,3045,037,0002,244,0002,142,208stderr