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 listMay 11, 2025 18:06vahookvahookScore: 5,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 18:065,00671,222,83337,497,0004,053,0002,465,792
2May 11, 2025 18:065,01367,284,50139,579,0002,029,0002,424,832
3May 11, 2025 18:065,03365,199,87837,792,0003,978,0002,465,792
4May 11, 2025 18:065,03971,420,30836,845,0004,979,0002,424,832
5May 11, 2025 18:065,05468,626,76939,950,0001,997,0002,273,280
6May 11, 2025 18:065,06063,316,07039,995,0001,999,0002,461,696
7May 11, 2025 18:065,07469,883,35839,108,0003,008,0002,424,832
8May 11, 2025 18:065,07565,606,96039,113,0003,008,0002,428,928
9May 11, 2025 18:065,07562,373,42540,117,0002,005,0002,428,928
10May 11, 2025 18:065,08064,505,50539,152,0003,011,0002,273,280
11May 11, 2025 18:065,08963,962,58540,225,0002,011,0002,420,736
12May 11, 2025 18:065,10461,249,51837,322,0005,043,0002,531,328