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 13:19Victor MerckléVictor MerckléScore: 1,437Success
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 13:201,38912,319,8742,418,0001,055,0002,117,632stderr
2Sep 14, 2026 13:201,39412,115,5132,408,0001,077,0002,117,632stderr
3Sep 14, 2026 13:201,42112,216,4042,018,0001,535,0002,117,632stderr
4Sep 14, 2026 13:201,42912,303,2952,489,0001,084,0002,117,632stderr
5Sep 14, 2026 13:201,43712,374,0952,442,0001,152,0002,117,632stderr
6Sep 14, 2026 13:201,49612,386,4682,610,0001,131,0002,117,632stderr
7Sep 14, 2026 13:201,50112,481,3592,627,0001,126,0002,117,632stderr
8Sep 14, 2026 13:201,51012,455,2522,632,0001,143,0002,117,632stderr
9Sep 14, 2026 13:201,52512,617,8922,663,0001,151,0002,117,632stderr