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 listJan 12, 2025 12:41AdityaAdityaScore: 405,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2025 12:41404,9403,387,503,2413,282,053,00078,953,0002,510,848
2Jan 12, 2025 12:41405,1773,392,839,6703,304,009,00058,964,0002,293,760
3Jan 12, 2025 12:41405,2063,389,085,5493,287,251,00075,959,0002,510,848
4Jan 12, 2025 12:41405,5663,397,095,2793,303,233,00062,966,0002,281,472
5Jan 12, 2025 12:41405,7543,390,501,3083,296,788,00070,973,0002,293,760
6Jan 12, 2025 12:41405,9543,398,554,7683,303,450,00065,969,0002,293,760
7Jan 12, 2025 12:41406,4583,400,469,4113,316,625,00056,976,0002,281,472
8Jan 12, 2025 12:41408,2133,415,153,6753,320,204,00067,963,0002,281,472
9Jan 12, 2025 12:41408,6043,421,668,3913,323,449,00067,968,0002,281,472