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:19Victor MerckléVictor MerckléScore: 1,802Success
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:211,73213,891,9803,239,0001,092,0002,117,632stderr
2Aug 29, 2026 11:211,73312,760,9843,229,0001,105,0002,117,632stderr
3Aug 29, 2026 11:211,74012,792,1523,251,0001,100,0002,117,632stderr
4Aug 29, 2026 11:211,76112,779,4153,278,0001,125,0002,117,632stderr
5Aug 29, 2026 11:211,80212,949,5073,361,0001,144,0002,117,632stderr
6Aug 29, 2026 11:211,80413,671,9103,391,0001,119,0002,117,632stderr
7Aug 29, 2026 11:211,84513,755,9393,142,0001,471,0002,117,632stderr
8Aug 29, 2026 11:211,85013,075,4293,141,0001,485,0002,117,632stderr
9Aug 29, 2026 11:211,87413,091,7613,520,0001,165,0002,117,632stderr