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 listMay 29, 2026 10:15Victor MerckléVictor MerckléScore: 2,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 10:162,63316,261,7405,239,0001,345,0002,113,536
2May 29, 2026 10:162,63514,405,7415,241,0001,347,0002,113,536
3May 29, 2026 10:162,63814,443,8805,247,0001,348,0002,113,536
4May 29, 2026 10:162,65214,521,4515,274,0001,357,0002,113,536
5May 29, 2026 10:162,65514,459,3015,282,0001,356,0002,113,536
6May 29, 2026 10:162,68614,521,5745,350,0001,365,0002,113,536
7May 29, 2026 10:162,70014,511,0285,408,0001,343,0002,113,536
8May 29, 2026 10:162,73714,626,4235,454,0001,389,0002,113,536
9May 29, 2026 10:162,75215,815,3015,540,0001,342,0002,113,536