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:28Dominique GarmierDominique GarmierScore: 41,896Success
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:2841,703129,424,67191,226,00013,032,0002,519,040
2Mar 24, 2026 19:2841,896136,848,11895,762,0008,977,0002,523,136
3Mar 24, 2026 19:2842,244139,147,28296,643,0008,966,0002,265,088