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 listSep 14, 2026 10:22Victor MerckléVictor MerckléScore: 1,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 10:231,43612,347,3852,527,0001,063,0002,117,632stderr
2Sep 14, 2026 10:231,44212,331,1122,537,0001,069,0002,117,632stderr
3Sep 14, 2026 10:231,44312,333,9722,542,0001,066,0002,117,632stderr
4Sep 14, 2026 10:231,44412,342,5682,543,0001,069,0002,117,632stderr
5Sep 14, 2026 10:231,46512,351,2942,589,0001,074,0002,117,632stderr
6Sep 14, 2026 10:231,48212,351,0882,630,0001,076,0002,117,632stderr
7Sep 14, 2026 10:231,51712,458,8602,694,0001,099,0002,117,632stderr
8Sep 14, 2026 10:231,51812,493,3742,557,0001,238,0002,117,632stderr
9Sep 14, 2026 10:231,59412,692,8322,733,0001,254,0002,117,632stderr