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 10, 2026 09:17Victor MerckléVictor MerckléScore: 2,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 09:192,43014,678,8923,892,0002,185,0002,146,304stderr
2Sep 10, 2026 09:192,44214,703,1303,678,0002,428,0002,146,304stderr
3Sep 10, 2026 09:192,44714,739,0033,827,0002,292,0002,146,304stderr
4Sep 10, 2026 09:192,45614,736,9173,671,0002,470,0002,146,304stderr
5Sep 10, 2026 09:192,47215,144,8883,914,0002,268,0002,146,304stderr
6Sep 10, 2026 09:192,47614,950,3893,920,0002,270,0002,146,304stderr
7Sep 10, 2026 09:192,49014,817,9913,704,0002,522,0002,146,304stderr
8Sep 10, 2026 09:192,51015,012,1493,875,0002,400,0002,146,304stderr
9Sep 10, 2026 09:192,54814,985,8863,914,0002,458,0002,146,304stderr