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 listJan 16, 2026 03:31Josu San MartinJosu San MartinScore: 9,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 03:319,96354,300,56617,933,0006,974,0002,428,928
2Jan 16, 2026 03:319,97753,128,21918,956,0005,986,0002,469,888
3Jan 16, 2026 03:3110,02851,018,48019,053,0006,017,0002,473,984