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 07:57Victor MerckléVictor MerckléScore: 2,504Success
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 07:592,40114,605,1643,861,0002,143,0002,146,304stderr
2Sep 10, 2026 07:592,41414,747,2443,811,0002,224,0002,146,304stderr
3Sep 10, 2026 07:592,47214,813,7283,710,0002,471,0002,146,304stderr
4Sep 10, 2026 07:592,49014,803,1963,983,0002,243,0002,146,304stderr
5Sep 10, 2026 07:592,50414,852,6033,837,0002,424,0002,146,304stderr
6Sep 10, 2026 07:592,51815,432,5073,878,0002,419,0002,146,304stderr
7Sep 10, 2026 07:592,52014,913,9174,015,0002,287,0002,146,304stderr
8Sep 10, 2026 07:592,53114,963,9983,946,0002,382,0002,146,304stderr
9Sep 10, 2026 07:592,58815,529,9973,822,0002,648,0002,146,304stderr