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 17:16Victor MerckléVictor MerckléScore: 1,447Success
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 17:171,43012,372,2262,499,0001,077,0002,117,632stderr
2Sep 14, 2026 17:171,43412,269,7532,499,0001,086,0002,117,632stderr
3Sep 14, 2026 17:171,43512,102,8642,493,0001,096,0002,117,632stderr
4Sep 14, 2026 17:171,44312,476,8472,520,0001,088,0002,117,632stderr
5Sep 14, 2026 17:171,44712,144,4032,503,0001,115,0002,117,632stderr
6Sep 14, 2026 17:171,46412,271,1372,522,0001,138,0002,117,632stderr
7Sep 14, 2026 17:171,49412,320,5262,607,0001,128,0002,117,632stderr
8Sep 14, 2026 17:171,49612,495,1672,610,0001,131,0002,117,632stderr
9Sep 14, 2026 17:171,52412,455,3212,667,0001,143,0002,117,632stderr