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 19, 2026 16:11Dominique GarmierDominique GarmierScore: 12,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 16:1112,05254,320,45726,112,0004,017,0002,310,144
2Mar 19, 2026 16:1112,06860,440,65522,126,0008,045,0002,326,528
3Mar 19, 2026 16:1112,33958,085,54325,873,0004,975,0002,322,432