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 listOct 6, 2026 07:12janwwwjanwwwScore: 1,087,768Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 16, 2026 13:57Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 07:121,087,7652,729,889,1232,718,408,0001,006,0002,113,536
2Oct 6, 2026 07:121,087,7682,729,791,0992,718,420,0001,002,0002,113,536
3Oct 6, 2026 07:121,093,1352,743,979,5812,731,527,0001,311,0002,113,536