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 listMay 17, 2026 14:19Jacob McDanielJacob McDanielScore: 7,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:277,21226,935,49815,893,0002,139,0002,113,536
2May 17, 2026 14:277,22827,674,16915,920,0002,151,0002,113,536
3May 17, 2026 14:277,32327,173,87216,142,0002,167,0002,113,536
4May 17, 2026 14:277,33327,730,01316,156,0002,178,0002,113,536
5May 17, 2026 14:277,34627,407,81316,212,0002,153,0002,113,536
6May 17, 2026 14:277,35129,215,69416,197,0002,182,0002,113,536
7May 17, 2026 14:277,38927,352,70616,278,0002,196,0002,113,536
8May 17, 2026 14:277,40129,134,98116,297,0002,206,0002,113,536
9May 17, 2026 14:277,43028,436,62016,376,0002,200,0002,113,536