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 14:57Victor MerckléVictor MerckléScore: 2,568Success
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 14:582,52413,872,0704,988,0001,324,0002,113,536
2Jun 1, 2026 14:582,53913,927,3105,017,0001,332,0002,113,536
3Jun 1, 2026 14:582,54013,918,1345,023,0001,327,0002,113,536
4Jun 1, 2026 14:582,55913,968,8445,044,0001,354,0002,113,536
5Jun 1, 2026 14:582,56814,042,9105,074,0001,348,0002,113,536
6Jun 1, 2026 14:582,57314,015,6685,099,0001,334,0002,113,536
7Jun 1, 2026 14:582,60214,053,4985,187,0001,318,0002,113,536
8Jun 1, 2026 14:582,61914,263,5875,218,0001,330,0002,113,536
9Jun 1, 2026 14:582,64316,002,1355,281,0001,328,0002,113,536