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 22:01Victor MerckléVictor MerckléScore: 2,542Success
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 22:032,53015,131,6584,994,0001,332,0002,113,536
2May 29, 2026 22:032,53013,969,7324,994,0001,331,0002,113,536
3May 29, 2026 22:032,53115,766,4214,995,0001,333,0002,113,536
4May 29, 2026 22:032,53515,803,1105,007,0001,331,0002,113,536
5May 29, 2026 22:032,54214,017,1985,021,0001,335,0002,113,536
6May 29, 2026 22:032,59815,557,5015,129,0001,367,0002,113,536
7May 29, 2026 22:032,59815,694,6865,129,0001,368,0002,113,536
8May 29, 2026 22:032,63915,818,0655,257,0001,342,0002,113,536
9May 29, 2026 22:032,63915,076,0135,270,0001,328,0002,113,536