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 13:46Victor MerckléVictor MerckléScore: 1,576Success
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 13:481,56612,296,9992,842,0001,073,0002,117,632stderr
2Aug 29, 2026 13:481,56912,275,7052,848,0001,075,0002,117,632stderr
3Aug 29, 2026 13:481,57012,355,8512,851,0001,076,0002,117,632stderr
4Aug 29, 2026 13:481,57212,449,6622,847,0001,084,0002,117,632stderr
5Aug 29, 2026 13:481,57612,328,7772,853,0001,087,0002,117,632stderr
6Aug 29, 2026 13:481,58312,330,5322,858,0001,100,0002,117,632stderr
7Aug 29, 2026 13:481,61212,452,5292,788,0001,243,0002,117,632stderr
8Aug 29, 2026 13:481,62012,417,7692,912,0001,138,0002,117,632stderr
9Aug 29, 2026 13:481,68412,576,7303,083,0001,128,0002,117,632stderr