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 9, 2026 16:06Victor MerckléVictor MerckléScore: 1,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 16:071,46012,269,9652,577,0001,073,0002,117,632stderr
2Sep 9, 2026 16:071,46512,252,4342,574,0001,090,0002,117,632stderr
3Sep 9, 2026 16:071,53313,016,6892,716,0001,118,0002,117,632stderr
4Sep 9, 2026 16:071,54212,217,9042,709,0001,146,0002,117,632stderr
5Sep 9, 2026 16:071,54712,449,1482,767,0001,102,0002,117,632stderr
6Sep 9, 2026 16:071,55312,261,7372,763,0001,121,0002,117,632stderr
7Sep 9, 2026 16:071,56312,431,6672,786,0001,123,0002,117,632stderr
8Sep 9, 2026 16:071,57012,526,6102,788,0001,137,0002,117,632stderr
9Sep 9, 2026 16:071,57512,708,5752,797,0001,141,0002,117,632stderr