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 2, 2026 00:34Victor MerckléVictor MerckléScore: 2,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 00:362,25013,306,9554,392,0001,234,0002,113,536
2Jun 2, 2026 00:362,25813,288,7104,410,0001,237,0002,113,536
3Jun 2, 2026 00:362,25813,320,1354,409,0001,236,0002,113,536
4Jun 2, 2026 00:362,26813,304,5874,428,0001,242,0002,113,536
5Jun 2, 2026 00:362,37213,597,1254,695,0001,236,0002,113,536
6Jun 2, 2026 00:362,37913,566,9884,698,0001,250,0002,113,536
7Jun 2, 2026 00:362,38613,950,7744,724,0001,241,0002,113,536
8Jun 2, 2026 00:362,39213,899,2594,742,0001,240,0002,113,536
9Jun 2, 2026 00:362,40813,901,7584,768,0001,254,0002,113,536