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 11:53Victor MerckléVictor MerckléScore: 1,629Success
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 11:551,58812,369,2642,880,0001,092,0002,117,632stderr
2Aug 29, 2026 11:551,59112,296,5062,871,0001,107,0002,117,632stderr
3Aug 29, 2026 11:551,59212,361,9872,872,0001,109,0002,117,632stderr
4Aug 29, 2026 11:551,59212,292,6692,876,0001,105,0002,117,632stderr
5Aug 29, 2026 11:551,62912,671,5452,943,0001,131,0002,117,632stderr
6Aug 29, 2026 11:551,65412,481,5792,997,0001,138,0002,117,632stderr
7Aug 29, 2026 11:551,66312,467,8543,008,0001,151,0002,117,632stderr
8Aug 29, 2026 11:551,68413,173,4913,070,0001,142,0002,117,632stderr
9Aug 29, 2026 11:551,68912,638,8523,087,0001,136,0002,117,632stderr