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 15:02Victor MerckléVictor MerckléScore: 2,541Success
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 15:032,51913,876,4584,968,0001,331,0002,113,536
2Jun 1, 2026 15:032,52113,882,6344,970,0001,333,0002,113,536
3Jun 1, 2026 15:032,52513,859,4884,980,0001,333,0002,113,536
4Jun 1, 2026 15:032,52613,930,1724,984,0001,332,0002,113,536
5Jun 1, 2026 15:032,54113,914,9635,019,0001,335,0002,113,536
6Jun 1, 2026 15:032,57014,009,9615,101,0001,326,0002,113,536
7Jun 1, 2026 15:032,58114,024,0005,081,0001,372,0002,113,536
8Jun 1, 2026 15:032,58514,345,3975,066,0001,397,0002,113,536
9Jun 1, 2026 15:032,63214,065,2405,248,0001,334,0002,113,536