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 listMay 29, 2026 12:15Victor MerckléVictor MerckléScore: 2,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 12:162,53014,548,3545,005,0001,320,0002,113,536
2May 29, 2026 12:162,53814,229,1445,025,0001,322,0002,113,536
3May 29, 2026 12:162,53915,179,7815,028,0001,320,0002,113,536
4May 29, 2026 12:162,65017,351,2345,306,0001,319,0002,113,536
5May 29, 2026 12:162,65417,488,3745,320,0001,316,0002,113,536
6May 29, 2026 12:162,65816,269,6495,318,0001,328,0002,113,536
7May 29, 2026 12:162,68416,102,6425,375,0001,337,0002,113,536
8May 29, 2026 12:162,71516,041,1884,529,0002,259,0002,113,536
9May 29, 2026 12:162,72116,235,7635,456,0001,347,0002,113,536