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 listDec 24, 2023 21:45Kenneth MaplesKenneth MaplesScore: 71,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 21:4570,318235,387,436175,794,41102,277,376
2Dec 24, 2023 21:4571,299239,696,776178,247,13202,281,472
3Dec 24, 2023 21:4571,324239,749,967178,308,95702,273,280