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 listMar 16, 2026 11:02Dominique GarmierDominique GarmierScore: 15,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 11:0215,70660,077,67736,245,0003,020,0002,428,928
2Mar 16, 2026 11:0215,70660,224,15336,246,0003,020,0002,375,680
3Mar 16, 2026 11:0215,73959,665,01434,303,0005,044,0002,433,024
4Mar 16, 2026 11:0215,75063,962,34137,356,0002,019,0002,428,928
5Mar 16, 2026 11:0215,76861,154,98933,355,0006,064,0002,428,928
6Mar 16, 2026 11:0215,79160,894,10536,442,0003,036,0002,260,992