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 27, 2026 01:20Victor MerckléVictor MerckléScore: 3,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:243,44017,582,1526,177,0002,425,0002,138,112
2Jun 27, 2026 01:243,46417,709,8085,811,0002,849,0002,134,016
3Jun 27, 2026 01:243,48017,704,7335,648,0003,052,0002,138,112
4Jun 27, 2026 01:243,50017,795,4715,860,0002,892,0002,138,112
5Jun 27, 2026 01:243,55617,900,1815,859,0003,033,0002,138,112
6Jun 27, 2026 01:243,56718,014,8686,089,0002,830,0002,138,112
7Jun 27, 2026 01:243,57418,000,7436,058,0002,878,0002,138,112
8Jun 27, 2026 01:243,62618,154,4706,161,0002,905,0002,129,920
9Jun 27, 2026 01:243,65918,160,8356,429,0002,719,0002,138,112