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 15, 2026 08:47Victor MerckléVictor MerckléScore: 1,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 08:531,34012,187,5251,847,0001,505,0002,117,632stderr
2Sep 15, 2026 08:531,34412,205,7812,285,0001,076,0002,117,632stderr
3Sep 15, 2026 08:531,36712,107,3691,893,0001,525,0002,117,632stderr
4Sep 15, 2026 08:531,37512,191,3942,340,0001,099,0002,117,632stderr
5Sep 15, 2026 08:531,37912,199,6541,900,0001,548,0002,117,632stderr
6Sep 15, 2026 08:531,38912,237,5122,350,0001,124,0002,117,632stderr
7Sep 15, 2026 08:531,45813,135,2552,106,0001,540,0002,117,632stderr
8Sep 15, 2026 08:531,48912,366,3222,159,0001,564,0002,117,632stderr
9Sep 15, 2026 08:531,49912,475,7012,159,0001,590,0002,117,632stderr