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 20, 2026 13:19Jacob McDanielJacob McDanielScore: 2,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 13:202,49917,817,3385,048,0001,200,0002,117,632
2May 20, 2026 13:202,50817,142,1015,057,0001,213,0002,117,632
3May 20, 2026 13:202,51217,331,4075,070,0001,212,0002,117,632
4May 20, 2026 13:202,57617,453,8275,193,0001,249,0002,117,632
5May 20, 2026 13:202,58415,769,8145,217,0001,245,0002,117,632
6May 20, 2026 13:202,60715,952,6535,241,0001,278,0002,117,632
7May 20, 2026 13:202,61017,566,0655,259,0001,268,0002,117,632
8May 20, 2026 13:202,63415,806,1195,425,0001,161,0002,117,632
9May 20, 2026 13:202,66616,115,9955,395,0001,271,0002,117,632