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 04:01Victor MerckléVictor MerckléScore: 2,556Success
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 04:032,52816,328,7004,988,0001,334,0002,113,536
2May 30, 2026 04:032,53214,099,5794,994,0001,337,0002,113,536
3May 30, 2026 04:032,53215,819,3864,999,0001,333,0002,113,536
4May 30, 2026 04:032,53914,392,0175,011,0001,338,0002,113,536
5May 30, 2026 04:032,55615,036,0115,038,0001,352,0002,113,536
6May 30, 2026 04:032,58816,379,6315,106,0001,364,0002,113,536
7May 30, 2026 04:032,63116,608,1315,248,0001,331,0002,113,536
8May 30, 2026 04:032,68715,866,6865,363,0001,356,0002,113,536
9May 30, 2026 04:032,69816,311,0174,466,0002,279,0002,113,536