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 10:59Victor MerckléVictor MerckléScore: 1,454Success
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 11:051,42412,286,5962,483,0001,077,0002,117,632stderr
2Sep 14, 2026 11:051,42612,301,8752,486,0001,079,0002,117,632stderr
3Sep 14, 2026 11:051,42712,308,6462,482,0001,087,0002,117,632stderr
4Sep 14, 2026 11:051,43112,294,1952,495,0001,083,0002,117,632stderr
5Sep 14, 2026 11:051,45412,373,9832,520,0001,116,0002,117,632stderr
6Sep 14, 2026 11:051,45512,403,2672,521,0001,117,0002,117,632stderr
7Sep 14, 2026 11:051,49212,449,7382,606,0001,126,0002,117,632stderr
8Sep 14, 2026 11:051,51912,542,6862,676,0001,122,0002,117,632stderr
9Sep 14, 2026 11:051,53612,554,3752,696,0001,144,0002,117,632stderr