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 15, 2026 00:02Victor MerckléVictor MerckléScore: 1,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 00:041,45312,347,2112,075,0001,559,0002,117,632stderr
2Sep 15, 2026 00:041,45421,461,4682,029,0001,606,0002,117,632stderr
3Sep 15, 2026 00:041,46212,375,3362,062,0001,593,0002,117,632stderr
4Sep 15, 2026 00:041,46812,649,7962,125,0001,547,0002,117,632stderr
5Sep 15, 2026 00:041,48312,399,6592,569,0001,140,0002,117,632stderr
6Sep 15, 2026 00:041,50412,416,3262,602,0001,159,0002,117,632stderr
7Sep 15, 2026 00:041,51420,647,0632,614,0001,172,0002,117,632stderr
8Sep 15, 2026 00:041,51512,534,7522,178,0001,611,0002,117,632stderr
9Sep 15, 2026 00:041,53612,427,4452,280,0001,561,0002,117,632stderr