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 10:36Victor MerckléVictor MerckléScore: 2,604Success
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 10:372,52513,888,1484,992,0001,322,0002,113,536
2Jun 1, 2026 10:372,53313,907,1085,008,0001,326,0002,113,536
3Jun 1, 2026 10:372,54213,936,2885,020,0001,337,0002,113,536
4Jun 1, 2026 10:372,60414,052,3095,191,0001,320,0002,113,536
5Jun 1, 2026 10:372,60413,884,7995,188,0001,324,0002,113,536
6Jun 1, 2026 10:372,61414,440,6495,212,0001,323,0002,113,536
7Jun 1, 2026 10:372,62114,126,3645,234,0001,320,0002,113,536
8Jun 1, 2026 10:372,62614,067,9115,244,0001,322,0002,113,536
9Jun 1, 2026 10:372,64214,128,9775,270,0001,337,0002,113,536