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 18:21Victor MerckléVictor MerckléScore: 1,772Success
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 18:231,72912,002,0623,110,0001,214,0002,113,536
2Jun 2, 2026 18:231,73012,010,4913,107,0001,218,0002,113,536
3Jun 2, 2026 18:231,73611,978,7343,120,0001,220,0002,113,536
4Jun 2, 2026 18:231,74212,006,2763,134,0001,221,0002,113,536
5Jun 2, 2026 18:231,77212,022,4763,209,0001,223,0002,113,536
6Jun 2, 2026 18:231,77412,142,4613,209,0001,226,0002,113,536
7Jun 2, 2026 18:231,77512,084,6623,211,0001,227,0002,113,536
8Jun 2, 2026 18:231,79312,079,9803,260,0001,223,0002,113,536
9Jun 2, 2026 18:231,87712,719,9503,475,0001,219,0002,113,536