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:26Victor MerckléVictor MerckléScore: 1,577Success
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:331,50712,158,2342,701,0001,068,0002,117,632stderr
2Aug 31, 2026 01:331,51512,042,6722,715,0001,073,0002,117,632stderr
3Aug 31, 2026 01:331,51711,987,7892,707,0001,087,0002,117,632stderr
4Aug 31, 2026 01:331,56812,429,6752,808,0001,112,0002,117,632stderr
5Aug 31, 2026 01:331,57712,346,2642,824,0001,120,0002,117,632stderr
6Aug 31, 2026 01:331,59612,328,9202,864,0001,126,0002,117,632stderr
7Aug 31, 2026 01:331,61813,022,1572,895,0001,151,0002,117,632stderr
8Aug 31, 2026 01:331,65422,445,3402,939,0001,198,0002,117,632stderr
9Aug 31, 2026 01:331,66412,405,4943,040,0001,120,0002,117,632stderr