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 20, 2026 09:32Dominique GarmierDominique GarmierScore: 11,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 09:3211,31852,863,90722,231,0006,063,0002,273,280
2Mar 20, 2026 09:3211,38955,173,07225,423,0003,050,0002,478,080
3Mar 20, 2026 09:3211,42651,574,98525,504,0003,060,0002,375,680