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 listOct 11, 2024 01:41Joad NacerJoad NacerScore: 4,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 01:414,49265,122,67734,260,0003,022,0002,334,720
2Oct 11, 2024 01:414,49465,242,19035,281,0002,016,0002,334,720
3Oct 11, 2024 01:414,50263,201,63434,334,0003,029,0002,510,848
4Oct 11, 2024 01:414,55965,099,37136,846,000995,0002,330,624
5Oct 11, 2024 01:414,56159,756,36235,863,0001,992,0002,314,240
6Oct 11, 2024 01:414,56662,976,78236,901,000997,0002,330,624