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 listOct 19, 2026 04:10zayd-ansari-codezayd-ansari-codeScore: 1,573,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 04:181,572,8053,942,822,5933,930,689,0001,324,0002,113,536
2Oct 19, 2026 04:181,573,7043,945,061,5893,933,235,0001,026,0002,113,536
3Oct 19, 2026 04:181,574,1783,946,778,5423,934,446,0001,000,0002,113,536