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 27, 2025 02:48zypehzypehScore: 72,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 02:4872,670630,419,197602,162,0001,000,0002,347,008
2Dec 27, 2025 02:4872,675633,100,697602,201,0001,000,0002,375,680
3Dec 27, 2025 02:4872,677631,932,839603,215,00002,375,680
4Dec 27, 2025 02:4872,876629,962,268601,868,0002,999,0002,375,680
5Dec 27, 2025 02:4872,891624,864,757601,994,0002,999,0002,367,488
6Dec 27, 2025 02:4872,920629,098,771604,236,0001,000,0002,347,008
7Dec 27, 2025 02:4872,940640,286,881604,403,000999,0002,347,008
8Dec 27, 2025 02:4872,958634,450,769602,555,0002,997,0002,347,008
9Dec 27, 2025 02:4872,973633,461,495602,675,0002,998,0002,347,008