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 18:25Victor MerckléVictor MerckléScore: 1,465Success
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 18:261,39512,322,0742,436,0001,052,0002,117,632stderr
2Sep 14, 2026 18:261,42812,185,6042,489,0001,081,0002,117,632stderr
3Sep 14, 2026 18:261,43412,082,2592,488,0001,099,0002,117,632stderr
4Sep 14, 2026 18:261,43512,356,3772,497,0001,091,0002,117,632stderr
5Sep 14, 2026 18:261,46512,539,9002,555,0001,109,0002,117,632stderr
6Sep 14, 2026 18:261,47312,441,4582,578,0001,105,0002,117,632stderr
7Sep 14, 2026 18:261,48612,593,7532,590,0001,125,0002,117,632stderr
8Sep 14, 2026 18:261,49812,525,2802,609,0001,136,0002,117,632stderr
9Sep 14, 2026 18:261,53312,385,1962,669,0001,165,0002,117,632stderr