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 listSep 15, 2026 07:23Victor MerckléVictor MerckléScore: 1,384Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 07:241,37012,220,8901,872,0001,554,0002,117,632stderr
2Sep 15, 2026 07:241,37012,203,9541,884,0001,541,0002,117,632stderr
3Sep 15, 2026 07:241,37912,306,4981,905,0001,544,0002,117,632stderr
4Sep 15, 2026 07:241,38012,006,9841,896,0001,554,0002,117,632stderr
5Sep 15, 2026 07:241,38412,121,1371,882,0001,579,0002,117,632stderr
6Sep 15, 2026 07:241,38612,247,9771,905,0001,562,0002,117,632stderr
7Sep 15, 2026 07:241,41012,310,9842,285,0001,240,0002,117,632stderr
8Sep 15, 2026 07:241,45112,401,0102,033,0001,596,0002,117,632stderr
9Sep 15, 2026 07:241,48212,444,1772,140,0001,567,0002,117,632stderr