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 listMay 4, 2026 22:39olliecrowolliecrowScore: 3,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 22:433,82125,351,6087,249,0002,305,0002,387,968
2May 4, 2026 22:433,89026,170,6847,416,0002,309,0002,396,160
3May 4, 2026 22:433,90529,927,1007,394,0002,370,0002,404,352
4May 4, 2026 22:433,91526,318,1677,409,0002,379,0002,408,448
5May 4, 2026 22:433,91727,708,0317,392,0002,402,0002,396,160
6May 4, 2026 22:433,94026,136,5897,452,0002,399,0002,400,256
7May 4, 2026 22:433,94127,303,5647,430,0002,423,0002,387,968
8May 4, 2026 22:433,95029,013,7647,450,0002,426,0002,392,064
9May 4, 2026 22:434,14227,201,2747,807,0002,549,0002,396,160