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 30, 2026 22:34Victor MerckléVictor MerckléScore: 1,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 22:371,46211,936,1152,582,0001,073,0002,117,632stderr
2Aug 30, 2026 22:371,46612,035,6482,600,0001,066,0002,117,632stderr
3Aug 30, 2026 22:371,47011,836,6782,612,0001,064,0002,117,632stderr
4Aug 30, 2026 22:371,47211,860,1732,605,0001,075,0002,117,632stderr
5Aug 30, 2026 22:371,47411,937,6872,608,0001,077,0002,117,632stderr
6Aug 30, 2026 22:371,47611,904,1042,607,0001,085,0002,117,632stderr
7Aug 30, 2026 22:371,48311,881,2592,616,0001,093,0002,117,632stderr
8Aug 30, 2026 22:371,48612,189,1622,633,0001,084,0002,117,632stderr
9Aug 30, 2026 22:371,59912,631,2772,827,0001,171,0002,117,632stderr