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 listFeb 5, 2026 05:02Josu San MartinJosu San MartinScore: 5,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 05:025,43929,172,4479,414,0004,184,0002,404,352
2Feb 5, 2026 05:025,47231,716,8289,472,0004,209,0002,494,464
3Feb 5, 2026 05:025,47432,937,4128,422,0005,264,0002,527,232