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 6, 2026 06:05Josu San MartinJosu San MartinScore: 3,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 06:053,55326,027,4575,922,0002,961,0002,400,256
2Feb 6, 2026 06:053,56329,378,9917,918,000989,0002,351,104
3Feb 6, 2026 06:053,66827,323,1206,113,0003,056,0002,334,720