Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 4, 2026 16:17boop34boop34Score: 29,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 16:1728,435246,963,081234,968,0001,046,0002,113,536
2Aug 4, 2026 16:1728,493247,392,475235,413,0001,081,0002,113,536
3Aug 4, 2026 16:1728,528246,944,272235,764,0001,021,0002,113,536
4Aug 4, 2026 16:1729,389253,941,411242,904,0001,027,0002,113,536
5Aug 4, 2026 16:1729,512254,968,310243,909,0001,045,0002,113,536
6Aug 4, 2026 16:1729,514255,163,590243,942,0001,026,0002,113,536
7Aug 4, 2026 16:1729,563256,225,355244,327,0001,048,0002,113,536
8Aug 4, 2026 16:1729,637256,815,485244,942,0001,051,0002,113,536
9Aug 4, 2026 16:1729,650256,122,031245,063,0001,034,0002,113,536