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 29, 2026 20:43Victor MerckléVictor MerckléScore: 2,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 20:452,65214,363,9295,351,0001,281,0002,113,536
2May 29, 2026 20:452,67715,980,4105,408,0001,285,0002,113,536
3May 29, 2026 20:452,67814,797,2135,405,0001,290,0002,113,536
4May 29, 2026 20:452,68316,157,0625,420,0001,288,0002,113,536
5May 29, 2026 20:452,73214,677,1755,513,0001,318,0002,113,536
6May 29, 2026 20:452,74217,712,8455,533,0001,323,0002,113,536
7May 29, 2026 20:452,76616,565,1645,635,0001,281,0002,113,536
8May 29, 2026 20:452,78114,801,6055,653,0001,300,0002,113,536
9May 29, 2026 20:452,78217,165,9395,672,0001,283,0002,113,536