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 listSep 23, 2026 18:17Matthias GörgensMatthias GörgensScore: 22,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 18:1722,34566,884,99053,837,0002,027,0002,117,632
2Sep 23, 2026 18:1722,58267,557,63054,428,0002,028,0002,117,632
3Sep 23, 2026 18:1722,66767,741,58354,635,0002,034,0002,117,632