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 listApr 28, 2026 00:30Victor MerckléVictor MerckléScore: 116,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 00:30116,156309,068,743283,381,0007,009,0002,506,752stderr
2Apr 28, 2026 00:30116,208311,023,624286,514,0004,007,0002,498,560stderr
3Apr 28, 2026 00:30116,654311,406,784286,627,0005,010,0002,498,560stderr