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 14:09Victor MerckléVictor MerckléScore: 1,582Success
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 14:111,57612,157,5052,860,0001,081,0002,117,632stderr
2Aug 29, 2026 14:111,57712,252,4392,870,0001,073,0002,117,632stderr
3Aug 29, 2026 14:111,57712,276,9252,874,0001,070,0002,117,632stderr
4Aug 29, 2026 14:111,58112,324,8832,885,0001,068,0002,117,632stderr
5Aug 29, 2026 14:111,58212,125,0152,885,0001,072,0002,117,632stderr
6Aug 29, 2026 14:111,58312,318,0472,878,0001,080,0002,117,632stderr
7Aug 29, 2026 14:111,60612,220,3612,905,0001,110,0002,117,632stderr
8Aug 29, 2026 14:111,61912,393,6482,959,0001,089,0002,117,632stderr
9Aug 29, 2026 14:111,62712,452,6592,871,0001,198,0002,117,632stderr