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 listMay 14, 2026 17:13Josu San MartinJosu San MartinScore: 1,249,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 17:361,246,1703,124,021,7653,114,424,0001,001,0002,129,920
2May 14, 2026 17:361,246,3073,124,679,2203,114,768,0001,000,0002,129,920
3May 14, 2026 17:361,246,6263,125,562,9493,114,559,0002,007,0002,129,920
4May 14, 2026 17:361,246,8303,129,808,8893,116,077,0001,000,0002,129,920
5May 14, 2026 17:361,249,0683,133,856,9953,121,670,0001,001,0002,129,920
6May 14, 2026 17:361,252,1243,141,698,3163,129,311,0001,000,0002,129,920
7May 14, 2026 17:361,252,9243,140,949,4193,130,226,0002,086,0002,129,920
8May 14, 2026 17:361,254,5143,144,898,1933,135,286,0001,000,0002,166,784
9May 14, 2026 17:361,254,5923,147,119,8723,135,482,0001,000,0002,166,784