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 listJun 2, 2026 04:35Victor MerckléVictor MerckléScore: 2,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 04:372,16214,592,4984,166,0001,240,0002,113,536
2Jun 2, 2026 04:372,16613,083,2874,179,0001,238,0002,113,536
3Jun 2, 2026 04:372,16913,516,2694,185,0001,239,0002,113,536
4Jun 2, 2026 04:372,18213,581,6814,204,0001,252,0002,113,536
5Jun 2, 2026 04:372,23413,265,1644,304,0001,281,0002,113,536
6Jun 2, 2026 04:372,23913,263,9824,314,0001,284,0002,113,536
7Jun 2, 2026 04:372,24613,170,5614,369,0001,246,0002,113,536
8Jun 2, 2026 04:372,26213,340,3984,408,0001,248,0002,113,536
9Jun 2, 2026 04:372,26413,633,6154,412,0001,249,0002,113,536