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 00:43Victor MerckléVictor MerckléScore: 1,554Success
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 00:491,47911,889,1662,617,0001,082,0002,117,632stderr
2Aug 31, 2026 00:491,48612,142,4462,631,0001,085,0002,117,632stderr
3Aug 31, 2026 00:491,51011,953,2182,644,0001,133,0002,117,632stderr
4Aug 31, 2026 00:491,54113,438,8492,732,0001,122,0002,117,632stderr
5Aug 31, 2026 00:491,55412,243,2982,770,0001,115,0002,117,632stderr
6Aug 31, 2026 00:491,56312,164,3332,786,0001,123,0002,117,632stderr
7Aug 31, 2026 00:491,56912,238,5192,808,0001,115,0002,117,632stderr
8Aug 31, 2026 00:491,57012,478,6432,787,0001,139,0002,117,632stderr
9Aug 31, 2026 00:491,61420,467,1822,858,0001,178,0002,117,632stderr