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 05:38Victor MerckléVictor MerckléScore: 2,559Success
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 05:402,52615,576,1624,988,0001,328,0002,113,536
2May 30, 2026 05:402,54614,140,0235,036,0001,329,0002,113,536
3May 30, 2026 05:402,54815,094,8965,037,0001,335,0002,113,536
4May 30, 2026 05:402,55716,375,5255,045,0001,349,0002,113,536
5May 30, 2026 05:402,55914,663,3495,067,0001,332,0002,113,536
6May 30, 2026 05:402,56114,164,5035,056,0001,348,0002,113,536
7May 30, 2026 05:402,58414,289,2075,112,0001,350,0002,113,536
8May 30, 2026 05:402,63714,129,5565,254,0001,340,0002,113,536
9May 30, 2026 05:402,65116,342,4785,294,0001,335,0002,113,536