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 17, 2026 00:04Victor MerckléVictor MerckléScore: 4,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 00:234,02219,689,0777,596,0002,461,0002,138,112stderr
2Aug 17, 2026 00:234,02521,433,8407,587,0002,477,0002,142,208stderr
3Aug 17, 2026 00:234,07819,816,4897,690,0002,505,0002,134,016stderr
4Aug 17, 2026 00:234,08519,862,4877,718,0002,496,0002,134,016stderr
5Aug 17, 2026 00:234,08619,849,9246,865,0003,352,0002,191,360stderr
6Aug 17, 2026 00:234,09019,895,5537,725,0002,501,0002,134,016stderr
7Aug 17, 2026 00:234,10219,901,0646,913,0003,343,0002,187,264stderr
8Aug 17, 2026 00:234,11620,376,6016,973,0003,319,0002,191,360stderr
9Aug 17, 2026 00:234,14420,361,5057,837,0002,524,0002,134,016stderr