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 listMay 22, 2026 12:50M-RochatM-RochatScore: 4,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 12:514,67821,039,75310,612,0001,084,0002,117,632
2May 22, 2026 12:514,68422,645,34910,624,0001,086,0002,121,728
3May 22, 2026 12:514,68522,584,73310,629,0001,085,0002,117,632
4May 22, 2026 12:514,68621,020,02010,629,0001,088,0002,117,632
5May 22, 2026 12:514,68821,053,45810,631,0001,089,0002,117,632
6May 22, 2026 12:514,75321,720,90310,784,0001,100,0002,117,632
7May 22, 2026 12:514,77321,726,87110,845,0001,088,0002,117,632
8May 22, 2026 12:514,81122,245,66210,933,0001,096,0002,117,632
9May 22, 2026 12:514,81821,337,10810,948,0001,097,0002,117,632