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 listMar 19, 2026 13:52Dominique GarmierDominique GarmierScore: 11,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 13:5211,41060,088,29823,432,0005,093,0002,285,568
2Mar 19, 2026 13:5111,41657,857,09324,463,0004,077,0002,293,760
3Mar 19, 2026 13:5111,42251,968,81025,495,0003,059,0002,506,752
4Mar 19, 2026 13:5111,43253,093,38622,455,0006,124,0002,371,584
5Mar 19, 2026 13:5211,48058,972,37225,625,0003,075,0002,277,376
6Mar 19, 2026 13:5211,55753,473,79621,918,0006,974,0002,265,088