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 16:56Victor MerckléVictor MerckléScore: 1,508Success
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 16:591,49011,931,0892,655,0001,071,0002,117,632stderr
2Aug 29, 2026 16:591,49211,908,5642,671,0001,059,0002,117,632stderr
3Aug 29, 2026 16:591,50012,110,7682,686,0001,065,0002,117,632stderr
4Aug 29, 2026 16:591,50611,998,6552,694,0001,071,0002,117,632stderr
5Aug 29, 2026 16:591,50812,024,4832,709,0001,062,0002,117,632stderr
6Aug 29, 2026 16:591,56012,193,7132,687,0001,215,0002,117,632stderr
7Aug 29, 2026 16:591,60612,238,1512,895,0001,122,0002,117,632stderr
8Aug 29, 2026 16:591,63819,553,9442,905,0001,190,0002,117,632stderr
9Aug 29, 2026 16:591,66219,511,1192,968,0001,189,0002,117,632stderr