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 listJul 7, 2026 19:37Victor MerckléVictor MerckléScore: 2,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:392,48116,596,3693,578,0002,625,0002,146,304stderr
2Jul 7, 2026 19:392,49016,448,6073,628,0002,598,0002,146,304stderr
3Jul 7, 2026 19:392,51317,054,4163,841,0002,443,0002,146,304stderr
4Jul 7, 2026 19:392,51516,844,7934,097,0002,192,0002,146,304stderr
5Jul 7, 2026 19:392,52517,545,3013,872,0002,442,0002,146,304stderr
6Jul 7, 2026 19:392,54117,007,0963,969,0002,385,0002,146,304stderr
7Jul 7, 2026 19:392,55616,946,8764,200,0002,190,0002,146,304stderr
8Jul 7, 2026 19:392,57416,536,7413,930,0002,507,0002,146,304stderr
9Jul 7, 2026 19:392,57616,948,8843,948,0002,492,0002,146,304stderr