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 07:08Victor MerckléVictor MerckléScore: 2,623Success
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 07:102,51114,439,4224,947,0001,332,0002,113,536
2May 30, 2026 07:102,54615,547,4635,029,0001,338,0002,113,536
3May 30, 2026 07:102,61216,648,6025,199,0001,333,0002,113,536
4May 30, 2026 07:102,62214,348,7335,218,0001,337,0002,113,536
5May 30, 2026 07:102,62315,718,6485,224,0001,334,0002,113,536
6May 30, 2026 07:102,63316,490,1065,249,0001,335,0002,113,536
7May 30, 2026 07:102,63314,259,7445,242,0001,341,0002,113,536
8May 30, 2026 07:102,67714,415,1384,410,0002,283,0002,113,536
9May 30, 2026 07:102,69214,464,7704,445,0002,285,0002,113,536