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 14, 2026 19:36Victor MerckléVictor MerckléScore: 1,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 19:371,39812,287,7872,426,0001,069,0002,117,632stderr
2Sep 14, 2026 19:371,43012,312,7912,028,0001,549,0002,117,632stderr
3Sep 14, 2026 19:371,43112,183,2182,489,0001,089,0002,117,632stderr
4Sep 14, 2026 19:371,43213,083,1772,028,0001,553,0002,117,632stderr
5Sep 14, 2026 19:371,43812,274,5662,496,0001,100,0002,117,632stderr
6Sep 14, 2026 19:371,45212,328,1512,532,0001,100,0002,117,632stderr
7Sep 14, 2026 19:371,48912,228,7302,588,0001,135,0002,117,632stderr
8Sep 14, 2026 19:371,50013,209,1582,622,0001,130,0002,117,632stderr
9Sep 14, 2026 19:371,51912,521,6922,653,0001,145,0002,117,632stderr