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 22, 2026 19:28Dominique GarmierDominique GarmierScore: 75,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 17:2475,137213,859,300180,848,0006,994,0002,449,408
2Mar 22, 2026 17:2475,146211,721,770175,874,00011,991,0002,449,408
3Mar 22, 2026 19:2875,169213,090,047180,926,0006,997,0002,445,312
4Mar 22, 2026 19:2875,397216,563,349183,479,0005,013,0002,437,120
5Mar 22, 2026 19:2876,146227,040,586177,340,00013,025,0002,437,120
6Mar 22, 2026 17:2476,408217,842,706185,021,0006,000,0002,494,464