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:52Dominique GarmierDominique GarmierScore: 29,281Success
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:5229,070103,823,43170,657,0002,018,0002,416,640
2Mar 30, 2026 05:5229,281102,871,02969,192,0004,011,0002,347,008
3Mar 30, 2026 05:5230,023105,578,33970,054,0005,003,0002,355,200