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 listApr 22, 2026 15:10Dominique GarmierDominique GarmierScore: 82,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 15:1382,407214,015,785202,019,0004,000,0002,396,160
2Apr 22, 2026 15:1382,424223,255,800204,062,0002,000,0002,433,024
3Apr 22, 2026 15:1382,437223,300,604203,092,0003,001,0002,473,984
4Apr 22, 2026 15:1382,470214,003,689203,174,0003,002,0002,478,080
5Apr 22, 2026 15:1382,773213,954,955201,935,0004,998,0002,539,520
6Apr 22, 2026 15:1382,826214,166,549203,064,0004,001,0002,539,520
7Apr 22, 2026 15:1382,862214,292,530204,155,0003,002,0002,514,944
8Apr 22, 2026 15:1382,866214,260,765205,166,0002,001,0002,490,368
9Apr 22, 2026 15:1382,950214,491,751203,369,0004,007,0002,457,600