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:53Dominique GarmierDominique GarmierScore: 544,866Success
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 18:14541,5881,381,284,1271,347,971,0005,999,0002,289,664
2Mar 22, 2026 18:14544,0371,390,023,9011,353,097,0006,995,0002,465,792
3Mar 22, 2026 19:53544,8481,385,887,1721,356,124,0005,996,0002,469,888
4Mar 22, 2026 19:53544,8661,386,010,7631,356,169,0005,996,0002,441,216
5Mar 22, 2026 19:53545,6121,389,399,4141,359,035,0004,996,0002,285,568
6Mar 22, 2026 18:14555,4731,407,908,9371,384,683,0003,999,0002,469,888