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 11:15Victor MerckléVictor MerckléScore: 2,526Success
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 11:172,50913,867,2744,950,0001,324,0002,113,536
2Jun 1, 2026 11:172,51413,846,5474,961,0001,326,0002,113,536
3Jun 1, 2026 11:172,51613,874,2624,963,0001,328,0002,113,536
4Jun 1, 2026 11:172,52213,882,3464,973,0001,334,0002,113,536
5Jun 1, 2026 11:172,52614,013,5424,984,0001,331,0002,113,536
6Jun 1, 2026 11:172,52914,403,7064,992,0001,331,0002,113,536
7Jun 1, 2026 11:172,53413,859,9815,013,0001,324,0002,113,536
8Jun 1, 2026 11:172,57614,017,5315,114,0001,327,0002,113,536
9Jun 1, 2026 11:172,68414,290,5934,435,0002,275,0002,113,536