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,440Success
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,40899,692,04661,466,0007,053,0002,510,848
2Dec 29, 2025 16:0527,44099,161,77164,565,0004,035,0002,519,040
3Dec 29, 2025 16:0528,43492,396,38762,074,0009,010,0002,514,944