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 31, 2026 01:11Victor MerckléVictor MerckléScore: 1,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:131,44812,059,5602,562,0001,060,0002,117,632stderr
2Aug 31, 2026 01:131,46412,029,1412,591,0001,069,0002,117,632stderr
3Aug 31, 2026 01:131,47811,869,7792,600,0001,097,0002,117,632stderr
4Aug 31, 2026 01:131,48712,133,5832,631,0001,087,0002,117,632stderr
5Aug 31, 2026 01:131,49611,958,6002,625,0001,116,0002,117,632stderr
6Aug 31, 2026 01:131,56712,305,8702,802,0001,116,0002,117,632stderr
7Aug 31, 2026 01:131,58912,998,9642,836,0001,137,0002,117,632stderr
8Aug 31, 2026 01:131,59613,011,9872,844,0001,147,0002,117,632stderr
9Aug 31, 2026 01:131,60020,492,4352,790,0001,211,0002,117,632stderr