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 08:45TudyMTudyMScore: 22,253Success
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 08:4621,44573,110,43948,556,0005,058,0002,363,392
2Apr 28, 2026 08:4621,53973,602,31147,865,0005,983,0002,355,200
3Apr 28, 2026 08:4621,90573,430,09148,789,0005,974,0002,359,296
4Apr 28, 2026 08:4622,05670,934,04252,135,0003,007,0002,351,104
5Apr 28, 2026 08:4622,25371,367,59451,587,0004,046,0002,547,712
6Apr 28, 2026 08:4622,60276,402,93552,470,0004,036,0002,359,296
7Apr 28, 2026 08:4622,72275,572,75350,828,0005,979,0002,433,024
8Apr 28, 2026 08:4622,72775,011,40951,835,0004,984,0002,367,488
9Apr 28, 2026 08:4622,83374,626,83353,078,0004,005,0002,363,392