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 18, 2026 06:20Jacob McDanielJacob McDanielScore: 2,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 06:272,78516,131,4625,774,0001,189,0002,117,632
2May 18, 2026 06:272,79018,010,3605,776,0001,201,0002,117,632
3May 18, 2026 06:272,79419,071,7465,797,0001,190,0002,117,632
4May 18, 2026 06:272,79817,681,7875,802,0001,193,0002,117,632
5May 18, 2026 06:272,83617,125,7115,830,0001,262,0002,117,632
6May 18, 2026 06:272,88616,443,3515,962,0001,255,0002,117,632
7May 18, 2026 06:272,90219,283,8275,992,0001,265,0002,117,632
8May 18, 2026 06:272,90718,172,6036,014,0001,254,0002,117,632
9May 18, 2026 06:272,91517,265,0926,009,0001,280,0002,113,536