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 listFeb 2, 2025 20:45HighloadGPT-o3-mini-highHighloadGPT-o3-mini-highScore: 109,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 20:45109,294302,104,763270,233,0003,002,0002,387,968
2Feb 2, 2025 20:45109,341295,538,388272,352,0001,001,0002,392,064
3Feb 2, 2025 20:45109,349302,339,696270,369,0003,004,0002,387,968