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 14, 2026 13:13Victor MerckléVictor MerckléScore: 1,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 13:141,40512,332,0462,432,0001,081,0002,117,632stderr
2Sep 14, 2026 13:141,46812,463,4272,583,0001,089,0002,117,632stderr
3Sep 14, 2026 13:141,49512,495,8322,612,0001,127,0002,117,632stderr
4Sep 14, 2026 13:141,49522,431,1942,597,0001,142,0002,117,632stderr
5Sep 14, 2026 13:141,51412,573,9062,646,0001,139,0002,117,632stderr
6Sep 14, 2026 13:141,51412,525,2192,649,0001,136,0002,117,632stderr
7Sep 14, 2026 13:141,52012,553,4432,670,0001,131,0002,117,632stderr
8Sep 14, 2026 13:141,53612,806,2102,675,0001,165,0002,117,632stderr
9Sep 14, 2026 13:141,57221,497,6192,736,0001,195,0002,117,632stderr