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:43Victor MerckléVictor MerckléScore: 2,574Success
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:452,50213,782,1914,934,0001,323,0002,113,536
2Jun 1, 2026 12:452,51413,853,4144,962,0001,324,0002,113,536
3Jun 1, 2026 12:452,51813,848,7444,968,0001,327,0002,113,536
4Jun 1, 2026 12:452,53513,885,1474,997,0001,342,0002,113,536
5Jun 1, 2026 12:452,57413,992,6905,116,0001,319,0002,113,536
6Jun 1, 2026 12:452,59414,013,3205,171,0001,316,0002,113,536
7Jun 1, 2026 12:452,61413,949,3445,212,0001,324,0002,113,536
8Jun 1, 2026 12:452,61514,270,5615,219,0001,319,0002,113,536
9Jun 1, 2026 12:452,63114,131,8835,253,0001,326,0002,113,536