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 19, 2026 21:14Jasper EdbrookeJasper EdbrookeScore: 1,137,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 21:141,134,4032,863,940,0492,835,009,000999,0002,273,280
2Mar 19, 2026 21:141,135,4102,862,256,4362,838,525,00002,273,280
3Mar 19, 2026 21:141,135,7012,865,327,9762,838,254,000999,0002,273,280
4Mar 19, 2026 21:141,137,2232,874,115,3752,840,061,0002,997,0002,273,280
5Mar 19, 2026 21:141,137,7582,869,187,5652,843,397,000999,0002,277,376
6Mar 19, 2026 21:141,138,0992,872,300,3862,843,250,0001,998,0002,277,376
7Mar 19, 2026 21:141,138,3742,871,514,5012,844,936,000999,0002,273,280
8Mar 19, 2026 21:141,138,6492,876,892,3682,844,624,0001,999,0002,269,184
9Mar 19, 2026 21:141,140,9912,888,284,3542,851,478,000999,0002,269,184