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 listApr 19, 2026 03:33olliecrowolliecrowScore: 4,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 03:334,75129,912,3969,899,0001,979,0002,420,736
2Apr 19, 2026 03:334,76028,061,6339,918,0001,983,0002,293,760
3Apr 19, 2026 03:335,00330,273,6678,338,0004,169,0002,289,664