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 listFeb 28, 2026 21:29wnwnScore: 4,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 21:294,53466,863,03936,613,0001,017,0002,277,376
2Feb 28, 2026 21:294,55969,253,57736,845,000995,0002,277,376
3Feb 28, 2026 21:304,55959,399,53735,850,0001,991,0002,277,376
4Feb 28, 2026 21:294,57156,481,41335,945,0001,996,0002,490,368
5Feb 28, 2026 21:304,59760,208,22636,151,0002,008,0002,498,560
6Feb 28, 2026 21:304,59763,034,02136,144,0002,008,0002,494,464