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 17, 2026 11:33M-RochatM-RochatScore: 4,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:334,30719,522,9349,704,0001,065,0002,117,632
2May 17, 2026 11:334,31319,607,6349,719,0001,064,0002,117,632
3May 17, 2026 11:334,34319,649,1909,793,0001,065,0002,117,632
4May 17, 2026 11:334,35319,578,2879,817,0001,066,0002,117,632
5May 17, 2026 11:334,37519,744,1909,875,0001,063,0002,113,536
6May 17, 2026 11:334,41219,650,4089,959,0001,072,0002,117,632
7May 17, 2026 11:334,41619,719,6439,967,0001,073,0002,117,632
8May 17, 2026 11:334,42819,841,6099,997,0001,074,0002,113,536
9May 17, 2026 11:334,44319,767,95010,035,0001,073,0002,113,536