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 12, 2024 19:00Yuriy LyfenkoYuriy LyfenkoScore: 1,263,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 19:001,260,8723,179,906,3873,150,181,0001,998,0002,285,568
2Dec 12, 2024 19:001,263,0603,185,168,5043,155,652,0001,998,0002,289,664
3Dec 12, 2024 19:001,264,0163,187,566,8623,157,041,0002,998,0002,289,664