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 19:32Victor MerckléVictor MerckléScore: 1,748Success
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 19:341,67312,722,5673,094,0001,090,0002,117,632stderr
2Aug 1, 2026 19:341,67812,687,3623,106,0001,089,0002,117,632stderr
3Aug 1, 2026 19:341,68412,684,4023,127,0001,083,0002,117,632stderr
4Aug 1, 2026 19:341,71012,768,1513,141,0001,134,0002,117,632stderr
5Aug 1, 2026 19:341,74814,110,0683,234,0001,138,0002,117,632stderr
6Aug 1, 2026 19:341,77213,030,8623,322,0001,109,0002,117,632stderr
7Aug 1, 2026 19:341,78313,600,7413,327,0001,131,0002,117,632stderr
8Aug 1, 2026 19:341,78713,212,9183,332,0001,137,0002,117,632stderr
9Aug 1, 2026 19:341,80513,121,9843,357,0001,156,0002,117,632stderr