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 1, 2026 10:27Victor MerckléVictor MerckléScore: 4,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 10:274,33023,249,7856,496,0004,330,0002,412,544
2May 1, 2026 10:274,36228,425,7754,957,0005,948,0002,408,448
3May 1, 2026 10:274,37027,368,3375,960,0004,966,0002,400,256
4May 1, 2026 10:274,37524,432,9034,972,0005,967,0002,404,352
5May 1, 2026 10:274,38428,323,0556,976,0003,986,0002,408,448
6May 1, 2026 10:274,39323,172,6545,991,0004,993,0002,478,080
7May 1, 2026 10:274,40628,836,8486,009,0005,008,0002,404,352
8May 1, 2026 10:274,42123,092,7006,029,0005,024,0002,322,432
9May 1, 2026 10:274,49326,162,6947,863,0003,370,0002,400,256