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 12:31caandocaandoError
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 12:32056,613,73637,612,0001,039,0002,469,888expected "53685166285314402 ", got "53685165187841948 "
2May 4, 2026 12:32055,514,00336,938,0001,040,0002,478,080expected "53686194221216964 ", got "53686194149014893 "
3May 4, 2026 12:324,56656,475,66536,862,0001,038,0002,478,080
4May 4, 2026 12:324,57154,945,30736,888,0001,057,0002,473,984
5May 4, 2026 12:324,59656,219,58037,114,0001,033,0002,478,080
6May 4, 2026 12:324,59956,947,48737,143,0001,036,0002,473,984
7May 4, 2026 12:324,61155,668,46537,236,0001,038,0002,449,408
8May 4, 2026 12:324,61756,493,07937,283,0001,039,0002,469,888
9May 4, 2026 12:324,63457,278,61837,426,0001,039,0002,461,696