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 listJul 31, 2026 06:15TonyTonyScore: 1,573,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 06:301,572,8803,942,244,3023,930,967,0001,234,0002,113,536
2Jul 31, 2026 06:301,573,1123,942,646,1533,931,771,0001,010,0002,113,536
3Jul 31, 2026 06:301,573,2733,943,053,4773,932,183,0001,000,0002,113,536