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 listMay 4, 2026 10:31Victor MerckléVictor MerckléScore: 114,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 10:31114,845304,759,428284,002,0003,112,0002,494,464stderr
2May 4, 2026 10:31114,846305,248,671284,072,0003,044,0002,478,080stderr
3May 4, 2026 10:31114,849303,058,485284,114,0003,009,0002,486,272stderr
4May 4, 2026 10:31114,860303,552,719284,143,0003,007,0002,490,368stderr
5May 4, 2026 10:31114,860303,912,398284,143,0003,007,0002,498,560stderr
6May 4, 2026 10:31114,862305,505,791284,107,0003,048,0002,322,432stderr
7May 4, 2026 10:31114,877301,654,761284,154,0003,040,0002,498,560stderr
8May 4, 2026 10:31115,386306,359,752285,376,0003,091,0002,482,176stderr
9May 4, 2026 10:31115,684304,312,241286,169,0003,041,0002,498,560stderr