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 21, 2026 04:57Charles CabergsCharles CabergsScore: 14,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 04:5714,43865,648,06026,069,00010,026,0002,424,832
2Apr 21, 2026 04:5714,45061,677,85027,095,0009,031,0002,433,024
3Apr 21, 2026 04:5714,46462,148,40127,121,0009,040,0002,424,832
4Apr 21, 2026 04:5714,48661,631,46426,156,00010,060,0002,416,640
5Apr 21, 2026 04:5714,50463,675,06929,211,0007,051,0002,428,928
6Apr 21, 2026 04:5714,51663,530,23526,210,00010,081,0002,433,024
7Apr 21, 2026 04:5714,57754,870,26326,321,00010,123,0002,473,984
8Apr 21, 2026 04:5714,58452,659,46726,334,00010,128,0002,359,296
9Apr 21, 2026 04:5714,74661,500,07225,906,00010,960,0002,437,120