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 5, 2026 01:46Victor MerckléVictor MerckléScore: 1,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 01:561,46512,130,9072,583,0001,080,0002,117,632stderr
2Sep 5, 2026 01:561,50212,890,5312,639,0001,117,0002,117,632stderr
3Sep 5, 2026 01:561,51012,256,7192,678,0001,099,0002,117,632stderr
4Sep 5, 2026 01:561,52712,408,5972,573,0001,246,0002,117,632stderr
5Sep 5, 2026 01:561,55112,445,2332,733,0001,146,0002,117,632stderr
6Sep 5, 2026 01:561,55812,341,4662,752,0001,145,0002,117,632stderr
7Sep 5, 2026 01:561,56613,063,4612,765,0001,150,0002,117,632stderr
8Sep 5, 2026 01:561,57413,113,9812,791,0001,145,0002,117,632stderr
9Sep 5, 2026 01:561,63413,245,5752,948,0001,139,0002,117,632stderr