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 listMar 30, 2026 05:18Dominique GarmierDominique GarmierScore: 66,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 05:1866,720196,835,487164,802,0001,997,0002,375,680
2Mar 30, 2026 05:1866,891199,561,848166,227,0001,001,0002,490,368
3Mar 30, 2026 05:1867,061198,636,297162,633,0005,019,0002,289,664