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 17, 2026 07:21flavio87flavio87Score: 5,560Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:27M-Rochat11.34CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:215,51754,096,30544,766,0001,032,0002,113,536
2May 17, 2026 07:215,51756,058,16744,773,0001,019,0002,113,536
3May 17, 2026 07:215,53755,716,48244,944,0001,021,0002,113,536
4May 17, 2026 07:215,55753,765,65345,083,0001,043,0002,113,536
5May 17, 2026 07:215,56055,454,84645,134,0001,020,0002,113,536
6May 17, 2026 07:215,57056,389,78245,202,0001,034,0002,113,536
7May 17, 2026 07:215,57254,249,39645,211,0001,040,0002,113,536
8May 17, 2026 07:215,61455,894,77245,577,0001,027,0002,113,536
9May 17, 2026 07:215,62455,148,42445,667,0001,020,0002,113,536