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 10, 2026 16:37Andrew EpsteinAndrew EpsteinScore: 2,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 16:481,93814,779,0463,522,0001,325,0002,134,016
2Sep 10, 2026 16:482,01314,965,7093,718,0001,316,0002,179,072
3Sep 10, 2026 16:482,05714,954,1393,811,0001,332,0002,134,016
4Sep 10, 2026 16:482,07715,001,5533,856,0001,337,0002,134,016
5Sep 10, 2026 16:482,08315,351,1423,880,0001,329,0002,134,016
6Sep 10, 2026 16:482,08515,148,7413,863,0001,350,0002,134,016
7Sep 10, 2026 16:482,09015,086,6183,767,0001,460,0002,134,016
8Sep 10, 2026 16:482,09115,193,1554,036,0001,193,0002,134,016
9Sep 10, 2026 16:482,09315,445,1403,899,0001,335,0002,134,016