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 15, 2026 05:47Victor MerckléVictor MerckléScore: 1,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 05:481,35812,194,6611,861,0001,535,0002,117,632stderr
2Sep 15, 2026 05:481,41112,396,6271,958,0001,570,0002,117,632stderr
3Sep 15, 2026 05:481,44412,275,0212,043,0001,568,0002,117,632stderr
4Sep 15, 2026 05:481,44812,339,3772,024,0001,598,0002,117,632stderr
5Sep 15, 2026 05:481,50012,727,4752,170,0001,582,0002,117,632stderr
6Sep 15, 2026 05:481,50013,193,9422,614,0001,138,0002,117,632stderr
7Sep 15, 2026 05:481,50212,516,4852,169,0001,586,0002,117,632stderr
8Sep 15, 2026 05:481,50213,112,4622,176,0001,581,0002,117,632stderr
9Sep 15, 2026 05:481,53212,637,1762,279,0001,551,0002,117,632stderr