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 29, 2024 15:42Jonas CohenJonas CohenScore: 1,269,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2024 15:421,269,5133,229,272,4313,173,782,91002,191,360
2Jul 29, 2024 15:421,269,8533,238,987,7633,174,633,24802,191,360
3Jul 29, 2024 15:421,270,5393,251,400,8823,176,347,16602,195,456