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 12, 2026 15:00limanjun99limanjun99Score: 38,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 15:0038,130119,433,20691,312,0004,013,000917,504
2Apr 12, 2026 15:0038,131121,660,62491,314,0004,013,000913,408
3Apr 12, 2026 15:0038,140122,790,82692,339,0003,011,000700,416
4Apr 12, 2026 15:0038,150120,581,45993,368,0002,007,000745,472
5Apr 12, 2026 15:0038,171122,754,35992,415,0003,013,000749,568
6Apr 12, 2026 15:0038,188121,010,00192,455,0003,014,000716,800
7Apr 12, 2026 15:0038,189127,103,65892,459,0003,014,000909,312
8Apr 12, 2026 15:0038,207121,735,89291,497,0004,021,000913,408
9Apr 12, 2026 15:0038,217122,726,73591,521,0004,022,000909,312