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 listDec 29, 2025 16:05Josu San MartinJosu San MartinScore: 27,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:0527,19693,298,76257,992,0009,998,0002,506,752
2Dec 29, 2025 16:0527,31495,561,92760,251,0008,033,0002,510,848
3Dec 29, 2025 16:0527,64895,637,84861,106,0008,014,0002,322,432