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 1, 2026 18:33Victor MerckléVictor MerckléScore: 1,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 18:351,62612,570,9622,986,0001,079,0002,117,632stderr
2Aug 1, 2026 18:351,63012,577,3622,994,0001,081,0002,117,632stderr
3Aug 1, 2026 18:351,64012,578,4583,002,0001,099,0002,117,632stderr
4Aug 1, 2026 18:351,69912,778,8333,118,0001,130,0002,117,632stderr
5Aug 1, 2026 18:351,72512,922,9503,186,0001,128,0002,117,632stderr
6Aug 1, 2026 18:351,73012,789,4543,209,0001,117,0002,117,632stderr
7Aug 1, 2026 18:351,73113,398,7363,184,0001,144,0002,117,632stderr
8Aug 1, 2026 18:351,75012,829,8913,264,0001,111,0002,117,632stderr
9Aug 1, 2026 18:351,75013,750,1293,210,0001,166,0002,117,632stderr