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 14, 2026 15:57Dominique GarmierDominique GarmierScore: 488,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 15:57487,6441,241,123,0181,218,110,000999,0002,289,664
2Mar 14, 2026 15:57488,3081,242,730,8131,219,772,000999,0002,314,240
3Mar 14, 2026 15:57488,4961,244,103,4051,219,242,0001,998,0002,289,664