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 22, 2026 17:13Dominique GarmierDominique GarmierScore: 155,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 17:13155,068412,611,366380,675,0006,994,0002,314,240
2Mar 22, 2026 17:13155,176413,861,526377,941,0009,998,0002,473,984
3Mar 22, 2026 17:13156,139415,872,143384,343,0006,005,0002,457,600