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 25, 2026 20:00Dominique GarmierDominique GarmierScore: 17,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 20:0016,58370,700,07338,425,0003,033,0002,297,856
2Mar 25, 2026 20:0017,01068,430,78239,488,0003,037,0002,486,272
3Mar 25, 2026 20:0017,29663,631,28640,224,0003,016,0002,297,856