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 listAug 29, 2026 13:31Victor MerckléVictor MerckléScore: 1,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:361,57712,374,8922,855,0001,089,0002,117,632stderr
2Aug 29, 2026 13:361,58512,346,6412,855,0001,108,0002,117,632stderr
3Aug 29, 2026 13:361,58712,281,9912,866,0001,103,0002,117,632stderr
4Aug 29, 2026 13:361,58812,356,1432,864,0001,106,0002,117,632stderr
5Aug 29, 2026 13:361,63412,508,9912,939,0001,148,0002,117,632stderr
6Aug 29, 2026 13:361,68812,577,3843,076,0001,145,0002,117,632stderr
7Aug 29, 2026 13:361,70012,622,4943,125,0001,127,0002,117,632stderr
8Aug 29, 2026 13:361,71312,629,7773,126,0001,157,0002,117,632stderr
9Aug 29, 2026 13:361,80722,056,0453,260,0001,258,0002,117,632stderr