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 listNov 29, 2024 22:29E SequeiraE SequeiraScore: 1,533,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 22:291,533,6023,865,465,5163,832,008,0001,998,0002,330,624
2Nov 29, 2024 22:291,533,7373,863,427,2543,832,344,0001,998,0002,473,984
3Nov 29, 2024 22:291,533,7453,858,410,9803,830,365,0003,997,0002,318,336