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 21, 2026 10:57Dominique GarmierDominique GarmierScore: 7,273,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 10:577,273,58418,236,981,57818,173,968,0009,991,0002,322,432
2Mar 21, 2026 10:577,273,68618,220,350,78118,183,216,000999,0002,375,680
3Mar 21, 2026 10:577,274,88218,228,457,08318,183,207,0003,997,0002,392,064