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 27, 2026 02:34Dominique GarmierDominique GarmierScore: 89,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 02:3489,221253,994,348215,052,0008,001,0002,367,488
2Mar 27, 2026 02:3489,224247,255,568218,059,0005,001,0002,314,240
3Mar 27, 2026 02:3489,447249,719,180215,632,0007,986,0002,351,104