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 listJul 5, 2026 18:19Victor MerckléVictor MerckléScore: 1,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 18:211,64212,182,7272,944,0001,161,0002,117,632stderr
2Jul 5, 2026 18:211,65812,079,9933,017,0001,130,0002,117,632stderr
3Jul 5, 2026 18:211,66012,204,7933,005,0001,147,0002,117,632stderr
4Jul 5, 2026 18:211,66212,175,7063,014,0001,143,0002,117,632stderr
5Jul 5, 2026 18:211,66712,745,3033,030,0001,139,0002,117,632stderr
6Jul 5, 2026 18:211,67012,188,8553,017,0001,158,0002,117,632stderr
7Jul 5, 2026 18:211,67312,298,9323,026,0001,158,0002,117,632stderr
8Jul 5, 2026 18:211,67512,168,9083,048,0001,141,0002,117,632stderr
9Jul 5, 2026 18:211,75212,400,2493,179,0001,202,0002,117,632stderr