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 29, 2026 11:16Victor MerckléVictor MerckléScore: 2,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 11:172,67014,494,0135,384,0001,293,0002,113,536
2May 29, 2026 11:172,67414,565,0455,388,0001,297,0002,113,536
3May 29, 2026 11:172,68115,888,1705,407,0001,297,0002,113,536
4May 29, 2026 11:172,68316,638,0255,405,0001,304,0002,113,536
5May 29, 2026 11:172,70717,455,0185,454,0001,314,0002,113,536
6May 29, 2026 11:172,77216,372,4215,641,0001,291,0002,113,536
7May 29, 2026 11:172,78617,527,6395,671,0001,294,0002,113,536
8May 29, 2026 11:172,86714,998,6904,929,0002,239,0002,113,536
9May 29, 2026 11:172,89515,102,8124,899,0002,340,0002,113,536