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 09:52Victor MerckléVictor MerckléScore: 1,914Success
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 09:571,87513,105,8783,604,0001,084,0002,117,632stderr
2Aug 29, 2026 09:571,89413,111,2993,626,0001,110,0002,117,632stderr
3Aug 29, 2026 09:571,90513,198,4723,652,0001,112,0002,117,632stderr
4Aug 29, 2026 09:571,91213,287,8223,598,0001,182,0002,117,632stderr
5Aug 29, 2026 09:571,91413,215,3303,654,0001,133,0002,117,632stderr
6Aug 29, 2026 09:571,92613,264,8563,676,0001,139,0002,117,632stderr
7Aug 29, 2026 09:571,95913,311,4703,748,0001,151,0002,117,632stderr
8Aug 29, 2026 09:571,98413,400,1473,833,0001,128,0002,117,632stderr
9Aug 29, 2026 09:572,01013,427,4193,922,0001,105,0002,117,632stderr