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 7, 2022 15:46Bernard TeoBernard TeoScore: 7,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2022 15:467,184117,710,42059,629,19402,273,280
2Sep 7, 2022 15:467,199129,250,03559,752,24202,281,472
3Sep 7, 2022 15:467,205122,324,48059,797,54302,281,472
4Sep 7, 2022 15:467,29585,154,87660,552,00002,273,280
5Sep 7, 2022 15:467,29985,221,57659,572,0001,009,0002,400,256
6Sep 7, 2022 15:467,30288,981,02159,600,0001,010,0002,273,280
7Sep 7, 2022 15:467,30392,941,59159,604,0001,010,0002,281,472
8Sep 7, 2022 15:467,30485,944,49260,627,00002,273,280
9Sep 7, 2022 15:467,30490,089,94360,622,00002,387,968
10Sep 7, 2022 15:467,30493,240,37960,623,00002,519,040
11Sep 7, 2022 15:467,30689,955,49260,641,00002,273,280
12Sep 7, 2022 15:467,30787,379,49160,649,00002,400,256
13Sep 7, 2022 15:467,32591,433,97959,805,000996,0002,273,280
14Sep 7, 2022 15:467,33284,300,32558,863,0001,995,0002,269,184
15Sep 7, 2022 15:467,35178,231,55560,014,0001,000,0002,273,280