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 12:53Victor MerckléVictor MerckléScore: 2,579Success
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 12:552,52015,350,5014,974,0001,327,0002,113,536
2Jun 1, 2026 12:552,53213,895,5794,998,0001,333,0002,113,536
3Jun 1, 2026 12:552,56714,032,4725,099,0001,319,0002,113,536
4Jun 1, 2026 12:552,57013,957,6765,098,0001,327,0002,113,536
5Jun 1, 2026 12:552,57914,055,2285,128,0001,320,0002,113,536
6Jun 1, 2026 12:552,60114,024,3355,182,0001,322,0002,113,536
7Jun 1, 2026 12:552,60814,057,7895,201,0001,321,0002,113,536
8Jun 1, 2026 12:552,61214,101,2355,209,0001,321,0002,113,536
9Jun 1, 2026 12:552,62014,054,8615,231,0001,320,0002,113,536