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 listJun 1, 2026 16:55Victor MerckléVictor MerckléScore: 2,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 16:572,76814,389,1045,589,0001,333,0002,113,536
2Jun 1, 2026 16:572,76914,371,3425,588,0001,336,0002,113,536
3Jun 1, 2026 16:572,77014,550,4185,588,0001,337,0002,113,536
4Jun 1, 2026 16:572,79214,585,1695,649,0001,332,0002,113,536
5Jun 1, 2026 16:572,85014,752,7965,791,0001,335,0002,113,536
6Jun 1, 2026 16:572,85914,826,7725,806,0001,343,0002,113,536
7Jun 1, 2026 16:572,86014,792,7205,815,0001,336,0002,113,536
8Jun 1, 2026 16:572,86215,065,5645,817,0001,340,0002,113,536
9Jun 1, 2026 16:572,87014,737,9095,829,0001,347,0002,113,536