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 20:44Victor MerckléVictor MerckléScore: 1,687Success
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 20:461,64212,044,3742,932,0001,173,0002,117,632stderr
2Jun 30, 2026 20:461,64412,113,4502,945,0001,167,0002,117,632stderr
3Jun 30, 2026 20:461,66612,010,0562,987,0001,178,0002,117,632stderr
4Jun 30, 2026 20:461,67212,104,6182,997,0001,184,0002,117,632stderr
5Jun 30, 2026 20:461,68712,157,2403,014,0001,205,0002,117,632stderr
6Jun 30, 2026 20:461,70812,157,8973,062,0001,210,0002,117,632stderr
7Jun 30, 2026 20:461,73212,558,3463,124,0001,208,0002,117,632stderr
8Jun 30, 2026 20:461,74012,682,7703,131,0001,221,0002,117,632stderr
9Jun 30, 2026 20:461,75412,692,0933,172,0001,214,0002,117,632stderr