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 15, 2026 19:43Victor MerckléVictor MerckléScore: 1,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 19:461,71611,479,2823,078,0001,212,0002,113,536
2Jun 15, 2026 19:461,71911,578,2143,089,0001,209,0002,113,536
3Jun 15, 2026 19:461,72611,727,8773,101,0001,215,0002,113,536
4Jun 15, 2026 19:461,73811,763,1443,112,0001,234,0002,113,536
5Jun 15, 2026 19:461,77611,815,8053,218,0001,223,0002,113,536
6Jun 15, 2026 19:461,78311,851,0333,246,0001,213,0002,113,536
7Jun 15, 2026 19:461,83011,946,4303,183,0001,394,0002,113,536
8Jun 15, 2026 19:461,87112,066,7633,519,0001,160,0002,113,536
9Jun 15, 2026 19:461,87212,077,2493,472,0001,209,0002,113,536