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 listJun 30, 2026 22:53Victor MerckléVictor MerckléScore: 1,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:551,63112,076,1552,922,0001,157,0002,117,632stderr
2Jun 30, 2026 22:551,66313,419,4752,980,0001,178,0002,117,632stderr
3Jun 30, 2026 22:551,66912,144,0262,995,0001,178,0002,117,632stderr
4Jun 30, 2026 22:551,69912,215,5703,046,0001,202,0002,117,632stderr
5Jun 30, 2026 22:551,70812,173,2513,072,0001,198,0002,117,632stderr
6Jun 30, 2026 22:551,74912,298,1593,146,0001,227,0002,117,632stderr
7Jun 30, 2026 22:551,75312,251,7203,183,0001,201,0002,117,632stderr
8Jun 30, 2026 22:551,76912,393,0193,202,0001,221,0002,117,632stderr
9Jun 30, 2026 22:551,79613,678,4363,332,0001,160,0002,117,632stderr