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 30, 2026 17:29Victor MerckléVictor MerckléScore: 1,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 17:311,75612,349,6923,162,0001,230,0002,117,632stderr
2Jun 30, 2026 17:311,77012,369,5063,170,0001,256,0002,117,632stderr
3Jun 30, 2026 17:311,77012,576,2663,168,0001,259,0002,117,632stderr
4Jun 30, 2026 17:311,78112,341,7713,184,0001,269,0002,117,632stderr
5Jun 30, 2026 17:311,78212,473,2563,202,0001,255,0002,117,632stderr
6Jun 30, 2026 17:311,78412,419,9233,229,0001,232,0002,117,632stderr
7Jun 30, 2026 17:311,79412,462,0533,130,0001,357,0002,117,632stderr
8Jun 30, 2026 17:311,87812,632,7853,430,0001,267,0002,117,632stderr
9Jun 30, 2026 17:311,90812,732,0683,497,0001,273,0002,117,632stderr