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 4, 2026 09:37limanjun99limanjun99Score: 5,147Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 09:385,12360,226,08740,160,0002,365,0002,498,560
2May 4, 2026 09:385,12759,944,79439,290,0003,267,0002,502,656
3May 4, 2026 09:385,13857,774,69339,385,0003,263,0002,506,752
4May 4, 2026 09:385,14759,016,34439,619,0003,105,0002,490,368
5May 4, 2026 09:385,14760,902,31539,455,0003,267,0002,502,656
6May 4, 2026 09:385,16159,576,26839,295,0003,548,0002,498,560
7May 4, 2026 09:385,16859,858,42439,631,0003,269,0002,498,560
8May 4, 2026 09:385,20462,727,96440,924,0002,271,0002,498,560
9May 4, 2026 09:385,29663,272,87740,817,0003,141,0002,498,560