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 10:05Victor MerckléVictor MerckléScore: 1,464Success
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 10:061,35112,215,6061,866,0001,513,0002,117,632stderr
2Sep 15, 2026 10:061,38812,239,0191,921,0001,550,0002,117,632stderr
3Sep 15, 2026 10:061,44212,393,2282,032,0001,574,0002,117,632stderr
4Sep 15, 2026 10:061,44212,376,8321,883,0001,723,0002,117,632stderr
5Sep 15, 2026 10:061,46412,616,2842,124,0001,537,0002,117,632stderr
6Sep 15, 2026 10:061,46412,465,7502,113,0001,547,0002,117,632stderr
7Sep 15, 2026 10:061,46512,446,4052,097,0001,566,0002,117,632stderr
8Sep 15, 2026 10:061,49015,791,1632,569,0001,158,0002,117,632stderr
9Sep 15, 2026 10:061,52313,320,4542,631,0001,178,0002,117,632stderr