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 listApr 29, 2026 05:35olliecrowolliecrowScore: 3,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 05:393,71025,912,1517,216,0002,061,0002,392,064
2Apr 29, 2026 05:393,71426,537,3227,223,0002,063,0002,383,872
3Apr 29, 2026 05:393,71828,407,5944,131,0005,164,0002,404,352
4Apr 29, 2026 05:393,73231,063,4555,184,0004,147,0002,396,160
5Apr 29, 2026 05:393,74725,172,7946,246,0003,123,0002,461,696
6Apr 29, 2026 05:393,76729,659,7507,326,0002,093,0002,404,352
7Apr 29, 2026 05:393,89226,949,9697,570,0002,162,0002,400,256
8Apr 29, 2026 05:393,91428,235,5557,612,0002,174,0002,396,160
9Apr 29, 2026 05:393,95228,996,8326,918,0002,964,0002,392,064