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 19, 2026 09:49Dominique GarmierDominique GarmierScore: 8,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 09:498,95446,982,86317,297,0005,087,0002,273,280
2Mar 19, 2026 09:498,97946,421,63617,346,0005,101,0002,371,584
3Mar 19, 2026 09:499,15650,853,19018,909,0003,980,0002,273,280