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 listSep 3, 2021 16:53Ilya AniskovetsIlya AniskovetsScore: 40,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2021 20:2440,927410,187,747339,694,19802,260,992
2Oct 29, 2021 20:2440,927408,111,360339,695,77002,256,896
3Oct 29, 2021 20:1840,942403,565,914339,822,72302,273,280
4Sep 3, 2021 14:0340,945408,352,381339,844,34502,273,280
5Oct 29, 2021 20:1840,945397,237,680339,842,51602,244,608
6Sep 3, 2021 14:0340,948404,596,062339,868,34902,260,992
7Sep 3, 2021 16:5340,951398,450,989339,895,99502,269,184
8Sep 3, 2021 16:5340,953406,366,282339,913,51402,260,992
9Sep 3, 2021 14:0340,955398,349,387339,928,83102,277,376
10Oct 29, 2021 20:1840,966404,697,916340,014,85902,281,472
11Oct 29, 2021 20:2440,968404,266,439340,037,74102,265,088
12Sep 3, 2021 16:5340,977406,546,151340,108,29402,269,184