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 listApr 28, 2026 23:08Charles CabergsCharles CabergsScore: 5,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 23:105,69131,750,54910,945,0003,283,0002,371,584
2Apr 28, 2026 23:105,70429,370,81510,187,0004,074,0002,375,680
3Apr 28, 2026 23:105,74732,465,56110,263,0004,105,0002,367,488
4Apr 28, 2026 23:105,75430,527,91010,275,0004,110,0002,383,872
5Apr 28, 2026 23:105,82631,620,95011,445,0003,121,0002,371,584
6Apr 28, 2026 23:105,88528,510,79910,510,0004,204,0002,379,776
7Apr 28, 2026 23:105,93233,713,39911,866,0002,966,0002,383,872
8Apr 28, 2026 23:105,97034,424,09210,946,0003,980,0002,367,488
9Apr 28, 2026 23:105,97129,193,02410,948,0003,981,0002,371,584