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 19, 2026 13:33Andrew EpsteinAndrew EpsteinScore: 4,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 14:044,30420,911,7139,509,0001,252,000532,480stderr
2Sep 19, 2026 14:044,30621,524,1329,522,0001,245,000532,480stderr
3Sep 19, 2026 14:044,30620,812,3079,518,0001,248,000532,480stderr
4Sep 19, 2026 14:044,31120,871,5749,531,0001,247,000532,480stderr
5Sep 19, 2026 14:044,31220,801,1969,529,0001,252,000532,480stderr
6Sep 19, 2026 14:044,31220,875,0049,534,0001,246,000532,480stderr
7Sep 19, 2026 14:044,31921,500,8479,548,0001,250,000532,480stderr
8Sep 19, 2026 14:044,32321,035,4089,533,0001,275,000532,480stderr
9Sep 19, 2026 14:044,33620,966,3009,585,0001,256,000532,480stderr