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 listJan 3, 2024 22:30Yurkov AlekseyYurkov AlekseyScore: 1,499,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2024 22:301,498,7133,817,160,4563,746,782,78602,187,264
2Jan 3, 2024 22:301,499,0333,810,776,0583,747,581,54602,191,360
3Jan 3, 2024 22:301,499,5223,800,355,7693,748,806,04402,187,264