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 listDec 8, 2025 11:03warshipwarshipScore: 53,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:0353,754471,114,737445,156,0001,000,0002,260,992
2Dec 8, 2025 11:0353,808476,371,950445,608,000999,0002,519,040
3Dec 8, 2025 11:0353,813472,149,375444,650,0001,998,0002,285,568
4Dec 8, 2025 11:0353,825480,741,264444,747,0001,998,0002,285,568
5Dec 8, 2025 11:0353,826473,338,848446,752,00002,285,568
6Dec 8, 2025 11:0353,843472,137,993445,897,000999,0002,285,568
7Dec 8, 2025 11:0353,845469,353,510444,918,0001,999,0002,371,584
8Dec 8, 2025 11:0353,890475,304,774447,287,00002,265,088
9Dec 8, 2025 11:0353,992470,461,764448,132,00002,285,568