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:56Victor MerckléVictor MerckléScore: 1,566Success
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:581,56112,083,3442,841,0001,062,0002,117,632stderr
2Aug 29, 2026 13:581,56212,227,8242,838,0001,069,0002,117,632stderr
3Aug 29, 2026 13:581,56512,080,9842,838,0001,076,0002,117,632stderr
4Aug 29, 2026 13:581,56612,070,2362,839,0001,076,0002,117,632stderr
5Aug 29, 2026 13:581,56612,240,0482,846,0001,070,0002,117,632stderr
6Aug 29, 2026 13:581,56812,294,7012,847,0001,075,0002,117,632stderr
7Aug 29, 2026 13:581,57812,104,1282,857,0001,089,0002,117,632stderr
8Aug 29, 2026 13:581,64212,432,0982,991,0001,114,0002,117,632stderr
9Aug 29, 2026 13:581,69412,594,9573,108,0001,129,0002,117,632stderr