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 9, 2023 21:19gchebanovgchebanovScore: 2,118,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 21:192,118,3345,356,469,7325,295,834,01302,260,992
2Jul 9, 2023 21:192,118,7095,358,860,2865,296,772,94802,281,472
3Jul 9, 2023 21:192,130,2725,390,279,4755,325,678,91502,273,280