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 listMay 30, 2026 02:01Victor MerckléVictor MerckléScore: 2,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 02:032,60215,449,2805,137,0001,368,0002,113,536
2May 30, 2026 02:032,60216,459,0745,138,0001,368,0002,113,536
3May 30, 2026 02:032,62116,145,5905,184,0001,370,0002,113,536
4May 30, 2026 02:032,63215,952,1265,424,0001,157,0002,113,536
5May 30, 2026 02:032,65715,419,0325,245,0001,399,0002,113,536
6May 30, 2026 02:032,67215,256,8755,299,0001,382,0002,113,536
7May 30, 2026 02:032,69815,014,1055,381,0001,365,0002,113,536
8May 30, 2026 02:032,70017,417,6135,382,0001,368,0002,113,536
9May 30, 2026 02:032,75815,427,8964,537,0002,360,0002,113,536