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 listMar 14, 2026 11:03Dominique GarmierDominique GarmierScore: 451,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 11:03451,2321,155,899,0641,128,081,00002,273,280
2Mar 14, 2026 11:03451,3371,156,262,9651,128,342,00002,269,184
3Mar 14, 2026 11:03451,5141,156,989,1591,127,786,000999,0002,441,216
4Mar 14, 2026 11:03451,7111,159,112,5591,128,278,000999,0002,273,280
5Mar 14, 2026 11:03451,7901,154,481,9011,127,476,0001,999,0002,441,216
6Mar 14, 2026 11:03451,8941,162,115,5721,128,737,000999,0002,293,760
7Mar 14, 2026 11:03451,9251,158,273,7051,128,813,000999,0002,269,184
8Mar 14, 2026 11:03452,0811,156,714,0511,129,203,000999,0002,273,280
9Mar 14, 2026 11:03452,2521,156,715,0451,130,629,00002,273,280