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 24, 2026 19:33Dominique GarmierDominique GarmierScore: 22,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 19:3322,34192,694,63146,877,0008,976,0002,289,664
2Mar 24, 2026 19:3322,42078,564,48249,045,0007,006,0002,428,928
3Mar 24, 2026 19:3322,86281,072,15248,131,0009,024,0002,301,952