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 listSep 17, 2026 20:12Andrew EpsteinAndrew EpsteinScore: 1,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 20:241,38412,042,4573,460,0000524,288
2Sep 17, 2026 20:241,39012,037,6603,477,0000524,288
3Sep 17, 2026 20:241,39212,046,0543,481,0000524,288
4Sep 17, 2026 20:241,39312,074,6413,484,0000524,288
5Sep 17, 2026 20:241,39412,053,8933,485,0000524,288
6Sep 17, 2026 20:241,39612,094,5733,492,0000524,288
7Sep 17, 2026 20:241,39812,035,0903,497,0000524,288
8Sep 17, 2026 20:241,40312,089,1493,508,0000524,288
9Sep 17, 2026 20:241,46812,316,7482,366,0001,305,000524,288