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 listSep 24, 2026 04:09wnwnScore: 3,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:093,29936,173,33626,378,0001,010,00020,480
2Sep 24, 2026 04:093,33336,424,77126,518,0001,148,0002,113,536
3Sep 24, 2026 04:093,33736,482,05126,651,0001,051,00020,480
4Sep 24, 2026 04:093,34036,561,68726,709,0001,014,0002,113,536
5Sep 24, 2026 04:093,34236,526,27326,659,0001,080,00020,480
6Sep 24, 2026 04:093,36136,651,23226,750,0001,148,0002,113,536
7Sep 24, 2026 04:093,39336,910,87027,127,0001,037,0002,113,536
8Sep 24, 2026 04:093,48937,732,94427,887,0001,079,00020,480
9Sep 24, 2026 04:093,53938,165,73628,235,0001,143,0002,113,536