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 listAug 15, 2026 22:20marko1597marko1597Score: 1,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:391,94414,912,8313,605,0001,255,0002,117,632
2Aug 15, 2026 22:391,94714,858,6013,620,0001,249,0002,117,632
3Aug 15, 2026 22:391,95014,838,8653,588,0001,289,0002,117,632
4Aug 15, 2026 22:391,96814,813,3213,651,0001,270,0002,117,632
5Aug 15, 2026 22:391,97615,051,1713,670,0001,270,0002,117,632
6Aug 15, 2026 22:391,97714,874,6423,662,0001,281,0002,117,632
7Aug 15, 2026 22:391,98214,885,1443,671,0001,285,0002,117,632
8Aug 15, 2026 22:391,98625,279,0513,599,0001,368,0002,117,632
9Aug 15, 2026 22:391,98814,915,2823,692,0001,278,0002,117,632