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 09:52Victor MerckléVictor MerckléScore: 2,607Success
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 09:532,50013,862,9864,926,0001,326,0002,113,536
2Jun 1, 2026 09:532,51013,815,5534,947,0001,329,0002,113,536
3Jun 1, 2026 09:532,51813,799,9154,966,0001,329,0002,113,536
4Jun 1, 2026 09:532,53513,854,6665,007,0001,331,0002,113,536
5Jun 1, 2026 09:532,60714,022,3875,200,0001,319,0002,113,536
6Jun 1, 2026 09:532,61214,016,0745,212,0001,320,0002,113,536
7Jun 1, 2026 09:532,61413,992,7865,207,0001,330,0002,113,536
8Jun 1, 2026 09:532,62214,156,1075,220,0001,337,0002,113,536
9Jun 1, 2026 09:532,64214,080,8385,265,0001,341,0002,113,536