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 25, 2024 18:55Elnur RakhmatullinElnur RakhmatullinScore: 47,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 18:5547,324421,548,521390,795,0001,998,0002,519,040
2Dec 25, 2024 18:5547,325420,896,337388,797,0003,997,0002,392,064
3Dec 25, 2024 18:5547,325415,071,570388,797,0003,997,0002,256,896
4Dec 25, 2024 18:5547,327425,502,949390,814,0001,999,0002,379,776
5Dec 25, 2024 18:5547,328418,630,390389,822,0002,998,0002,519,040
6Dec 25, 2024 18:5547,328421,400,250391,821,000999,0002,519,040
7Dec 25, 2024 18:5547,330426,833,679389,838,0002,998,0002,519,040
8Dec 25, 2024 18:5547,346424,743,553390,972,0001,999,0002,519,040
9Dec 25, 2024 18:5547,350419,354,648390,003,0003,000,0002,256,896