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 1, 2026 20:05Victor MerckléVictor MerckléScore: 1,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 20:061,57912,489,5282,846,0001,103,0002,117,632stderr
2Aug 1, 2026 20:061,59812,490,7682,876,0001,121,0002,117,632stderr
3Aug 1, 2026 20:061,62212,531,8562,919,0001,136,0002,117,632stderr
4Aug 1, 2026 20:061,64512,599,7692,988,0001,126,0002,117,632stderr
5Aug 1, 2026 20:061,65512,598,2163,008,0001,130,0002,117,632stderr
6Aug 1, 2026 20:061,66512,599,8063,049,0001,114,0002,117,632stderr
7Aug 1, 2026 20:061,68512,648,6323,091,0001,123,0002,117,632stderr
8Aug 1, 2026 20:061,68913,430,1513,079,0001,145,0002,117,632stderr
9Aug 1, 2026 20:061,70613,503,2563,105,0001,160,0002,117,632stderr