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 10, 2026 21:06Victor MerckléVictor MerckléScore: 25,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 21:1225,03570,150,44859,201,0003,388,0002,113,536
2Jun 10, 2026 21:1225,43871,194,74560,133,0003,462,0002,113,536
3Jun 10, 2026 21:1225,62271,773,18660,720,0003,337,0002,113,536
4Jun 10, 2026 21:1225,64871,625,65661,023,0003,099,0002,113,536
5Jun 10, 2026 21:1225,66771,680,44961,131,0003,038,0002,113,536
6Jun 10, 2026 21:1225,68271,693,56261,131,0003,076,0002,113,536
7Jun 10, 2026 21:1225,69671,616,22061,204,0003,038,0002,113,536
8Jun 10, 2026 21:1225,75271,919,47761,197,0003,183,0002,113,536
9Jun 10, 2026 21:1226,11272,873,72761,685,0003,596,0002,113,536