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 1, 2026 10:00Victor MerckléVictor MerckléScore: 2,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 10:022,50313,817,2514,934,0001,324,0002,113,536
2Jun 1, 2026 10:022,50813,816,0574,949,0001,321,0002,113,536
3Jun 1, 2026 10:022,51013,786,7054,951,0001,326,0002,113,536
4Jun 1, 2026 10:022,51813,916,2204,967,0001,329,0002,113,536
5Jun 1, 2026 10:022,52613,871,6214,989,0001,328,0002,113,536
6Jun 1, 2026 10:022,59514,019,2395,172,0001,316,0002,113,536
7Jun 1, 2026 10:022,61214,079,3115,189,0001,342,0002,113,536
8Jun 1, 2026 10:022,61614,042,6415,218,0001,322,0002,113,536
9Jun 1, 2026 10:022,61614,025,7995,219,0001,322,0002,113,536