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 listApr 26, 2026 11:26olliecrowolliecrowScore: 4,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 11:284,21627,580,1769,488,0001,054,0002,396,160
2Apr 26, 2026 11:284,23825,466,8589,536,0001,059,0002,404,352
3Apr 26, 2026 11:284,23929,435,9579,539,0001,059,0002,306,048
4Apr 26, 2026 11:284,24530,615,27310,614,00002,396,160
5Apr 26, 2026 11:284,25726,716,5409,580,0001,064,0002,355,200
6Apr 26, 2026 11:284,36231,142,3136,940,0003,966,0002,387,968
7Apr 26, 2026 11:284,42530,138,6128,046,0003,017,0002,396,160
8Apr 26, 2026 11:284,43628,432,3748,067,0003,025,0002,400,256
9Apr 26, 2026 11:284,56928,603,7888,308,0003,115,0002,387,968