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 listMay 29, 2026 21:46Victor MerckléVictor MerckléScore: 2,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 21:482,53614,143,3635,007,0001,335,0002,113,536
2May 29, 2026 21:482,53914,209,8455,015,0001,333,0002,113,536
3May 29, 2026 21:482,54314,734,8885,024,0001,335,0002,113,536
4May 29, 2026 21:482,55415,266,1805,039,0001,346,0002,113,536
5May 29, 2026 21:482,62816,757,6725,242,0001,329,0002,113,536
6May 29, 2026 21:482,62814,273,0855,242,0001,329,0002,113,536
7May 29, 2026 21:482,63615,396,7545,252,0001,339,0002,113,536
8May 29, 2026 21:482,63714,132,8515,261,0001,332,0002,113,536
9May 29, 2026 21:482,63914,288,5435,267,0001,331,0002,113,536