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 13:17Victor MerckléVictor MerckléScore: 1,658Success
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 13:191,55812,357,9112,772,0001,124,0002,117,632stderr
2Aug 29, 2026 13:191,58312,307,7382,864,0001,095,0002,117,632stderr
3Aug 29, 2026 13:191,59212,357,1362,876,0001,105,0002,117,632stderr
4Aug 29, 2026 13:191,63312,369,9052,859,0001,224,0002,117,632stderr
5Aug 29, 2026 13:191,65812,723,0992,991,0001,154,0002,117,632stderr
6Aug 29, 2026 13:191,68312,581,4333,085,0001,124,0002,117,632stderr
7Aug 29, 2026 13:191,70612,648,0603,117,0001,149,0002,117,632stderr
8Aug 29, 2026 13:191,70612,712,4703,108,0001,157,0002,117,632stderr
9Aug 29, 2026 13:191,71413,444,0613,131,0001,155,0002,117,632stderr