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 listJul 12, 2023 22:10Yuriy LyfenkoYuriy LyfenkoScore: 129,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 22:10128,611382,699,749321,526,48402,228,224
2Jul 12, 2023 22:10129,020376,158,038322,548,96302,220,032
3Jul 12, 2023 22:10131,290393,914,246328,225,45502,232,320