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 listJun 12, 2026 04:57Victor MerckléVictor MerckléScore: 1,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 04:591,86412,297,8643,126,0001,534,0002,125,824
2Jun 12, 2026 04:591,90512,445,1453,211,0001,553,0002,125,824
3Jun 12, 2026 04:591,92212,450,5213,228,0001,578,0002,125,824
4Jun 12, 2026 04:591,95412,702,7283,347,0001,540,0002,125,824
5Jun 12, 2026 04:591,96012,544,6043,349,0001,553,0002,125,824
6Jun 12, 2026 04:591,98712,545,9193,414,0001,554,0002,125,824
7Jun 12, 2026 04:592,00112,953,8363,439,0001,564,0002,125,824
8Jun 12, 2026 04:592,00412,638,9843,467,0001,543,0002,125,824
9Jun 12, 2026 04:592,02213,002,6273,506,0001,550,0002,125,824